notes16b

None look at i1 if it is empty we add the value there

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the front/ infrequently accessed items remain towards the end positive à༎eventually the list is in optimal ordering July 2nd, 2013 Complexity: worst case O(n), but actual retrievals are much faster - Linked lists - Python lists Hash Tables • • array based structures to store items map each key to a unique position in the array using a hash function o retrieval is O(1) - if the hash function can be computed in O(1) time Ex...
View Full Document

This note was uploaded on 02/04/2014 for the course CS 234 taught by Professor Baranoski during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online