Design and Analysis of Algorithms

This well organized text provides the design techniques of algorithms in a simple and straight forward manner. It describes the complete development of various algorithms along with their pseudo-codes in order to have an understanding of their applications. The book begins with a description of the fundamental concepts and basic design techniques of algorithms. Gradually, it introduces more complex and advanced topics such as dynamic programming, backtracking and various algorithms related to graph data structure. Finally, the text elaborates on np-hard, matrix operations and sorting network. Primarily designed as a ext for undergraduate students of computer science and engineering and information technology (b. Tech. , computer science, b. Tech. It) and postgraduate students of computer applications (mca), the book would also be quite useful to postgraduate students of computer science and it (m. Sc. , computer science; m. Sc. , it). New to this second edition: a new section on characteristics of algorithms (section 1. 3) has been added; five new sections on insertion sort (section 2. 2), bubble sort (section 2. 3), selection sort (section 2. 4), shell sort/diminishing increment sort/comb sort (section 2. 5) and merge sort (section 2. 6) have been included; a new chapter on divide and conquer (chapter 5) has also been incorporated.