Items related to Programs and Data Structures in C: Based on ANSI C...
Synopsis
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.
"synopsis" may belong to another edition of this title.
From the Publisher
An advanced treatment of algorithms and data structures using the C language. Features rewritten programs upgraded to the new ANSI C standard, in such a way that they also conform to the C++ language. Includes a section on AVL trees and a greater use of standard library functions. The author provides a wide range of algorithms, programs and exercises with an emphasis on the ability to develop new algorithms.
About the Author
Leendert Ammeraal
Hogeschool Utrecht, The Netherlands
"About this title" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
