Programs and Data Structures in C
Based on ANSI C and C++
L. Ammeraal(Author)
Wiley (Publisher)
2nd Edition
Published on 6. November 1991
Book
Hardback
288 pages
978-0-471-93124-9 (ISBN)
Description
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.
More details
Edition
2nd Revised edition
Language
English
Place of publication
Chichester
United Kingdom
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Edition type
Revised edition
Illustrations
bibliography, index
Dimensions
Height: 305 mm
Width: 305 mm
Weight
120 gr
ISBN-13
978-0-471-93124-9 (9780471931249)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification