Hashing

Advance Algorithm Analysis and Design

A (dynamic) set of elements in which we do search, insert, and delete Linear ones: lists, stacks, queues, Nonlinear ones: trees, graphs (relations between elements are explicit) Now for the case relation is not important, but want to be efficient for searching (like in a dictionary)!

By :Asif Mahmood Lect: GDC DIKHAN