Algorithms + Data StructuresFundamental data structures; Sorting; Recursive algorithms; Dynamic information structures; Language structures and compilers. |
Contents
FUNDAMENTAL DATA STRUCTURES | 1 |
RECURSIVE ALGORITHMS | 125 |
DYNAMIC INFORMATION STRUCTURES | 162 |
Copyright | |
4 other sections not shown
Other editions - View all
Common terms and phrases
alfa algorithm allocation array assume average path length B-tree balanced tree begin getsym binary tree boolean Bubblesort called char compiler components const construct copyrun data structure data types defined deletion denote digits eight queens problem element end else begin end end example expression function getsym else error getsym end graph h₁ heap Heapsort Hilbert curves identifier initial input insertion integer merge mergesort node operations optimal output parameter parser parsing partition path length pointer problem procedure Program 5.6 programming languages Quicksort read(ch record recursive repeat representation represented result root rules scan search tree selection semicolon sentinel sequence sequential shown in Fig single solution sorting algorithms sorting methods ssym statement storage straight syntax Table tape tapeno terminal terminal symbols top-down parsing Topological sorting variable weighted path length word writeln