: Algebraic specifications for abstract data types (ADTs) and their practical implementations.
: Comprehensive analysis of sorting algorithms such as Quicksort , Mergesort , and Heapsort , as well as graph and tree treatments. : Algebraic specifications for abstract data types (ADTs)
The second edition, published in 1998 by Prentice Hall , covers a range of advanced programming techniques: published in 1998 by Prentice Hall
: Detailed study of stacks, queues, lists, heaps, and tables. Structure of the Text : Algebraic specifications for abstract data types (ADTs)
: Defining the "what" before the "how".