000			01351nam a22002177a 4500
999			_c756 _d756
005			20200923105730.0
008			190121b ||||| |||| 00| 0 eng d
020			_a9789350140918
040			_c0
082			_a004.421 _bRAJ
100			_aRajput, Vinod K.
245			_aDesign and analysis of algorithms
250			_a2nd ed.
260			_aNew Delhi : _bS. K. Kataria & Sons, _c2012.
300			_a613 pages : _bill.; _c23 cm.
505			_tGrowth of Function _tRecurrence _tSorting Algorithms _tDivide and Conquer _tHeapsort _tQuicksort _tSorting in Linear Time _tMedian and Order Statistics _tRed Black Tree _tAugmenting Data Structures _tDynamic Programming _tGreedy Algorithms _tAmortized Analysis _tB-Tree _tBinomial Heaps _tFibonacci Heaps _tData Strutures for Disjoint Sets _tBacktracking _tBranch and Sounds _tElementary Graph Algorithms _tMinimum Spanning Tree _tSingle Source Shortest Paths _tAll Pairs Shortest Path _tMaximum Flow _tSorting Networks _tMatrix Operations _tPolynomials and the FFT _tNumber Theoretic Algorithms _tString Matching _tNP-Completeness _tApproximation Algorithms
520			_aThis 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.
650			_aData structures (Computer science)
650			_aAlgorithms
942			_2ddc _cG