Lecture-17

書籍內容簡介

Lecture 17: Overview of complex data structures, Dynamic memory allocation Summary of Lecture: Overview of Complex Data Structures Dynamic memory allocation HASHING The search time of each algorithm discussed so far depends on the number n of elements in the collection S of data. This section discusses a searching technique, called hashing or hash addressing, which is essentially independent of the number n. First of all, we assume that there is a file F of n records with a set K of keys which u…