[Home Page] - [Reviews Main]

An Introduction to the Analysis of Algorithms by Sedgewick & Flajolet

ISBN: 0 201 40009 X       Publisher: Addison-Wesley       Pages: 492pp       Price: £29-95

Categories:   algorithms     maths

Reviewed by Graham Kendall in C Vu 9-2 (Jan 1997)

It is predominantly about how to analyse algorithms using mathematics. To give you a trivial example, you may be considering whether to use a linked list or a binary tree to hold some data and you want to know how the different data structures compare when performing operations such as inserting, searching and updating. This book shows you how to analyse the data structures from this perspective. It requires a certain level of mathematics.

This book takes a more mathematical approach than 'Fundamentals of Algorithmics' and is more advanced in the treatment of the subject. The decision which one you buy will probably rest on how confident you are at dealing with things like ' Euler-Maclaurin summation ' and how familiar you already are with basic algorithms such as searching, sorting, etc.

This book assumes a certain level of knowledge. For example, it is assumed you are happy with Linked Lists as these are only introduced as a method to implement Hashing. The book is packed with exercises. Chapter four, for example, has 82 exercises spread throughout it.

Before buying this book you need to make sure what you are getting. You are not being told how to implement any particular algorithm (although it may help). If actually coding a particular algorithm is your main concern then there are more suitable books. If you wish to understand, from a mathematical viewpoint, how algorithms work then this book is worth your consideration. The final decision will come down to your level of mathematics and your level of knowledge of the subject.