Held: Friday, 2 May 2003
Summary: Today we consider one of the most important implementations of dictionaries, Hash tables.
a lot like arrays(except that you index dictionaries by object and arrays by number).
sum the values of the letters in the name.
A: 1 F: 6 K: 11 P: 16 U: 21 Z: 26 B: 2 G: 7 L: 12 Q: 17 V: 22 C: 3 H: 8 M: 13 R: 18 W: 23 D: 4 I: 9 N: 14 S: 19 X: 24 E: 5 J: 10 O: 15 T: 20 Y: 25
shift into a blank spacetechnique for resolving collisions, what do we do when it comes time to remove elements?
remove. We might remove the element with a particular key. We might instead remove elements based on their value. The second is obviously a much slower operation than the first (unless we've developed a special way to handle that problem - see if you can think of one).
Thursday, 15 January 2003 [Samuel A. Rebelsky]
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue May 6 09:21:12 2003.
The source to the document was last modified on Thu Jan 16 15:16:16 2003.
This document may be found at