Project: Back-end Architecture and Design

submited by krishnas on Thu Mar 10th, 2011

At the beginning of this series I reviewed the difference between trees and hash tables and defined when you might use one over the other. As a quick recap, a hash table stores its information in a contiguous block of memory, akin to an array, and executes a hashing algorithm on its objects to determine how those objects map to indexes within the hash table. Because objects are hashed to indexes within the hash table it is possible to insert, retrieve, and remove objects from a hash table in constant time.

Topic: java