04/05 Lecture Material
Sorted List ADT (Linked Implementation)
- add(newEntry), O(n)
- remove(anEntry), O(n)
- getPosition(anEntry), O(n)
- getEntry(givenPosition), O(n)
- contains(anEntry), O(n)
- remove(givenPosition), O(n)
- clear(), O(1)
- getLength(), O(1)
- isEmpty(), O(1)
- isFull(), O(1)
- display(), O(n)