CHAPTER 2: THE ARRAY STRUCTURE
CHAPTER 6: GENERAL LISTS: MULTIPLE ACCESS PATHS
CHAPTER 9: MULTIPLE ACCESS PATHS TO DATA
SECTION C: CIRCULAR LIST OPERATIONS
SECTION D: INTEGER ARITHMETIC OF UNBOUNDED PRECISION
SECTION F: STACKS IN THE LANGUAGE FORTH
SECTION K: A SIMULATION OF AN AIRPORT CUSTOMS STATION
SECTION L: CHAINING IN SCATTER STORAGE
SECTION M: WALKING A GENERAL LIST
SECTION N: THE MAIN DIAGONAL CIRCULATION SPARSE MATRIX
SECTION O: A QUICKSORT PROGRAM
SECTION P: A BALANCED STATIC BST
SECTION S: FILE MERGING AND MERGESORT
SECTION T: PRIORITY QUEUE EXTENSION OF MERGE RUNS
SECTION V: THE EIGHT COINS PROBLEM
SECTION W: NODE EVALUATION AND PRUNING OF GAME TREES