The author provides a discussion of algorithms and data structures, using the C language. The text avoids any algorithmic vagueness by presenting complete programs in which the student can insert his or her own output statements to see what the algorithm does. In the second edition all programs have been rewritten in ANSI C, in such a way that they also conform to C++ language rules. This is possible by using only those language elements that are available both in ANSI C and in C++. An important new subject is AVL trees (including node deletion). Besides a recursive function to generate a complete list of permutations, there is also an iterative function, "nextperm", to generate only the next permutation. The same also applies to combinations, for which there is a function, "nextcomb". The program BTREE.C now displays a representation of the complete B-tree each time it is updated. Finally, more use is made of standard library functions. For example, there is a discussion of the standard library function "qsort" and how this relates to quicksort functions used in the programs.
- ISBN10 0471931241
- ISBN13 9780471931249
- Publish Date 6 November 1991
- Publish Status Out of Print
- Out of Print 18 February 2022
- Publish Country GB
- Publisher John Wiley and Sons Ltd
- Imprint John Wiley & Sons Ltd
- Edition 2nd Revised edition
- Format Hardcover
- Pages 288
- Language English