Menu Introduction Bibliography

Basics Arrays Linked Lists Timing Estimates Summary

Sorting Insertion Sort Shell Sort Quick Sort Comparison External Sorts

Dictionaries Hash Tables Binary Trees Red-Black Trees Skip Lists Comparison

Bibliography

Aho, Alfred V. and Jeffrey D. Ullman [1983].Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts.

Cormen, Thomas H., Charles E. [2009].Introduction to Algorithms, 3rd edition. McGraw-Hill, New York.

Knuth, Donald E. [1998].The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley, Reading, Massachusetts.

Pearson, Peter K. [1990].Fast Hashing of Variable-Length Text Strings. Communications of the ACM, 33(6):677-680, June 1990.

Pugh, William [1990].Skip Lists: A Probabilistic Alternative to Balanced Trees. Communications of the ACM, 33(6):668-676, June 1990.

Stephens, Rod [1998].Ready-to-Run Visual Basic Algorithms. John Wiley & Sons, New York.