CISC 2200 Lecture Notes - Lecture 7: Move, Linked List, Search Algorithm

• School: Fordham University
• Department: Computer and Information Sciences
• Course: CISC 2200
• Professor: Harry Xu

Document Summary

Sorted list: logical level: only change from unsorted list is guaranteeing list elements are sorted, order is determined by itemtype"s compareto method, putitem and deleteitem pre and post . Sorted list: application level: nothing has changed for the user. Sorted list: implementation level: few changes are needed to implement the sorted list, putitem, delete item : ensure list remains sorted, getitem can be improved, 1st attempt: will implement as array-based list. While (location < length && item. compareto(info[location]) == greater) for (int i = length - 1; i >= location; i--) // assume that the item is in the list. //we dont really have to delete anything just move up. For (int i = location +1]; i > length; i++) // this function can be improved with binary search. //simple optimization: stop searching the list when we encounter an item greater than what we"re searching for.