CP164 Lecture 8: Sorted/unsorted list and circular array implementation
Document Summary
Use loops to look through a list. Whatever i ut in first come ahead of the objects of the same value. Cannor reverse a sorted list ( no longer sorted. Do not use reverse method, make own reverse. Len: return the number of values in list. Remove: you are not allowed to use python list remove. Index:value and tells you where in list it is. Append: give me an unsorted list and i will add to end. Clear: removes all items from the list. In assign 4 asks to implement circular based queue. Adds data to the ed of an array upon insertion and takes data from the front of an array upon removal. If you add six value remove 2. Data is added and removed in circular motions and indices move. Rear says pointing at next available spot. If no more spots make rear none". Should be checking anyways to check if available.
