
Lesson 14-4: Sorted Lists of Objects
Pointers and Linked Lists | 371
Name __________________________________________ Date _______________________
Section _________________________________________
Exercise 1: Class ItemList puts each new item at the front of the list because that is the most
efficient algorithm if the list is unordered. However, searching for an item requires that the entire
list be searched to determine that an item is not in the list. If the list is ordered, the search can stop
when the place is passed where the item would be if it were present in the list. Specify an ordered
list class. Fill in the following chart showing which algorithms ...