What people are saying - Write a review
We haven't found any reviews in the usual places.
Arrays in COBOL and Pascal
20 other sections not shown
adjacency matrix AVL tree B-tree basic binary search tree binary tree bucket buffer channel program chapter character COBOL Comm COMPUTE contains cylinder data records data structure Database deletion direct-access disk doubly linked list EBCDIC edge empty entries example Figure graph hash function height-balanced tree implement in-order indexed sequential file INFO input files insertion integer internal sort INVALID KEY inversion index key value linear list linear probing logic m-way search tree main memory master file Merge pass multi-list nodeptr null number of nodes operations output file Pascal path performance pointer post-order procedure processing queue quicksort RECORD KEY relative address relative file RELATIVE KEY represent representation result retrieval right subtree row-major order secondary storage selection selection sort sequence sequential access shown in Fig SOCNO space sparse array stack storage device stored string sublists subscript tape TOP-PTR track transaction traversal trie update variable