The.Algorithm.Design.Manual.Springer-Verlag.1998

Lecture 7 - elementary data structures
● Search - O(1) expected, O(n) worst case
● Insert - O(1) expected, O(n) worst case
● Delete - O(1) expected, O(n) worst case
● Min, Max and Predecessor, Successor expected and worst case
Pragmatically, a hash table is often the best data structure to maintain a dictionary. However, we will not use it
much in proving the efficiency of our algorithms, since the worst-case time is unpredictable.
The best worst-case bounds come from balanced binary trees, such as red-black trees.
Next: Lecture 8 - binary Up: No Title Previous: Lecture 6 - linear
Algorithms
Mon Jun 2 09:21:39 EDT 1997
file:///E|/LEC/LECTUR17/NODE7.HTM (13 of 13) [19/1/2003 1:34:42]