September 01, 1996
Algorithm AlleyEdward Sitarski
To overcome the limitations of variable-length arrays, Edward created a data structure that has the fast constant-access time of an array, but avoids copying elements when it grows. He calls this structure a "Hashed-Array Tree" (HAT) because it combines some of the features of hash tables, arrays, and trees.
|
|
|||||||||||||||||
|
|
|
|