Associated article: Algorithm Alley
Published source code in the article by Edward Sitarski in which Edward overcomes the limitations of variable-length arrays by creating a data structure which has fast constant access time like an array, but mostly 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. Requires PKUNZIP.EXE to extract.
Table Of Contents: QUICKSRT.T QUICKSRT.H MAIN.CPP HAT.T HAT.H ARRAY.T ARRAY.H