[Home Page] - [Reviews Main]

Data Structures and Algorithm Analysis in C by Mark Allen Weiss Recommended

ISBN: 0 201 49840 5       Publisher: Addison-Wesley       Pages: 510pp       Price: £24-95

Categories:   data structures     algorithms

Reviewed by Graham Kendall in C Vu 9-5 (Jul 1997)

There is obviously a mathematical element to this book but it is kept to a minimum and much of the book is spent discussing the algorithms themselves; which I think most people would prefer. As the examples are in C this book will attract a much wider audience than Pascal equivalents.

As you would expect, the book starts with the 'standard' data structures (stacks, lists, queues and trees). Other structures such as heaps, graphs and sets are considered later.

As well as discussing data structures various algorithms are examined. You would expect sorting to be covered and all the classic sorts are here (e.g. mergesort, shellsort, and quicksort). Some algorithms you may not expect to be covered are given space. For example, randomised algorithms, greedy algorithms and backtracking algorithms. The book also covers NP- completeness.

Sample code is given throughout (available via an FTP site) and the book will allow you to implement the algorithms that are discussed as well as being able to reason about their time complexity (i.e. how long do they take to run).

If you are looking for a book covering algorithms and their analysis then this is as good as any I've seen (and I've seen a lot) and it does cover a lot of ground.