Link Details

This is the fifth post in an article series about MIT’s lecture course “Introduction to Algorithms.” In this post I will review lectures seven and eight, which are on the topic of Hashing. Many applications require a dynamic set that supports dictionary operations insert, search, and delete. For example, a compiler for a computer language maintains a symbol table, in which the keys of elements are arbitrary strings that correspond to identifiers in the language. A hash table is an effective data structure for implementing dictionaries.