applicationthe sparse matrix list-based implementation efficiency analysis exercises programming projects searching and sorting searching the linear search the binary search sorting bubble sort selection sort insertion sort working with sorted lists maintaining sorted list merging sorted lists the set adt revisited sorted list implementation comparing the implementations exercises programming projects linked structures introduction the singly linked list traversing the nodes searching for node prepending nodes removing nodes the bag adt revisited linked list implementation comparing implementations linked list iterators more ways to build linked list using tail reference the sorted linked list the sparse matrix revisited an array of linked lists implementation comparing the implementations applicationpolynomials polynomial operations vii