One Implementation of a Dictionary: An Association List

( (key1, value1), ..., (keyn, valuen) )

(key1,value1)

(key2,value2)

(keyn,valuen)

Worst case time for GET is ?(n) cell examinations.

Expected case time for a successful GET is n/2 cell examinations, also ?(n).

Previous slide

Next slide

Back to first slide

View graphic version