Design and Analysis of Algorithms

This book is structured to cover the key aspects of the subject Design and Analysis of Algorithms in 31 chapters. The book gives in-depth understanding of important topics like - algorithms, asymptotic notations, growth of function, recurrences, sorting in polynomial time, sorting in linear time, advanced data structure, advanced design and analysis techniques, graph algorithms, string matching, randomized algorithms, np-completeness and reduction, approximation algorithms, FFT and sorting network.