Design analysis and algorithms / Hari Mohan Pandey

Includes index.

grwoth of functions -- recurrence: master's theorem -- sorting and sorting methods -- quick sort -- divide and conquer methods -- sorting in linear time -- medians and order statistics -- red-black trees -- auementing data structures -- b-trees -- binomial heaps -- fibonacci heaps -- data structure for disjoint sets -- dynamic programming -- greedy algorithms -- amortized analysis -- back-tracking -- branch and bound technique -- assignment problem -- string matching -- elementary graph algorithms -- minimum spanning tree -- single source shortest path algorithm -- all pairs shortest paths algorithm -- maximum flow -- randomized -- np-competeness -- approximation algorithm.

1