Rajput, Vinod K. <br/><br/>
Design and analysis of algorithms 

 - 2nd ed. 
 - New Delhi :  S. K. Kataria & Sons,   2012. 
 - 613 pages :  ill.;  23 cm. 
<br/><br/> Growth of Function  Recurrence  Sorting Algorithms  Divide and Conquer  Heapsort  Quicksort  Sorting in Linear Time  Median and Order Statistics  Red Black Tree  Augmenting Data Structures  Dynamic Programming  Greedy Algorithms  Amortized Analysis  B-Tree  Binomial Heaps  Fibonacci Heaps  Data Strutures for Disjoint Sets  Backtracking  Branch and Sounds  Elementary Graph Algorithms  Minimum Spanning Tree  Single Source Shortest Paths  All Pairs Shortest Path  Maximum Flow  Sorting Networks  Matrix Operations  Polynomials and the FFT  Number Theoretic Algorithms  String Matching  NP-Completeness  Approximation Algorithms 
<br/><br/> This book provides a treatment of designing procedures of algorithms and how to analyze algorithms. The book is applicable for courses in data structures and algorithms. 
<br/><br/><label>ISBN: </label>9789350140918 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Data structures (Computer science)<br/>Algorithms
<br/><br/><label>Dewey Class. No.: </label>004.421  / RAJ