Archive for March, 2007
As we saw with binary search, certain data structures such as a binary search tree can help improve the efficiency of searches. From linear search to binary search, we improved our search efficiency from O(n) to O(logn). We now present a new data structure, called a hash table, that will increase our efficiency to O(1), […]
Search
Search:You are currently browsing the DataStructures weblog archives for March, 2007.
Longer entries are truncated. Click the headline of an entry to read it in its entirety.

