Pandey, Hari Mohan <br/><br/>
Design analysis and algorithms /  
Hari Mohan Pandey 
 - Newdelhi :    University science press.,    2009. 
 - xiii, 560 p. :    ill ;    25 cm. 
<br/><br/> Includes index. 
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9788131803349 
<br/><br/><label>Subjects--Uniform Titles: </label><br/>Fundamentals of Data Structures & Algorithms
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.
<br/><br/><label>Dewey Class. No.: </label>511.8