Now in its second edition, this text provides comprehensive coverage of the design techniques of algorithms. It traces the development of various algorithms in a step by step approach followed by their pseudo-codes, to build an understanding of their practical applications.

After an introduction, the book provides a detailed account of graphs and data structure. It then discusses matrix algorithms, basic algorithms, network algorithms, sorting algorithm, backtracking algorithms and search algorithms. The text also focuses on heuristics, dynamic programming and meta heuristics. The concepts of cryptography and probabilistic algorithms are described in detail. Finally, the book discusses the underlying concepts in the benchmarking of algorithms, algorithms to schedule processor(s) and complexity of algorithms.