Algorithms and Data Structures
From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms Plus Data Structure Equals Programs (PH, l975). This title uses Modula-2 and includes new material on sequential structure, searching and priority search trees.
What people are saying - Write a review
We haven't found any reviews in the usual places.
allocation array assume average path length B-tree balanced tree BEGIN binary tree BOOLEAN Bubblesort buffer C.A.R. Hoare called CARDINAL CHAR components copyrun count data structure data types defined deletion denote digit distribution dummy runs element ELSIF END END END example expressed FALSE Fibonacci FORi given heap Heapsort height Hilbert curves initial InOut IMPORT input INTEGER left subtree merge Mergesort Modula-2 MODULE node number of runs operations p2t.right parameter partition path length pattern perfectly balanced tree performance pointers Polyphase problem PROCEDURE pt.bal pt.key pt.left Quicksort Read(ch rebalancing RECORD recursive REPEAT representation represented result right subtree root scheme search tree search(x selection sentinel seqno sequential Shellsort shown in Fig single solution sorting algorithms sorting methods statement storage straight insertion string Table termination topological sorting tree structure variable weighted path length word WPtr WriteLn