000			02062nam a2200193Ia 4500
999			_c3659 _d3659
003			OSt
005			20230601112014.0
008			140801s2009 xx 000 0 und d
020			_a9788120340077
082			_a518.1 COR-I
100			_aCormen, Thomas H[et.al]
245			_aINTRODUCTION TO ALGORITHMS
260			_bPHI _c2009 _aNew Delhi
300			_a1292p.
500			_a1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Divide-and-Conquer 5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics Introduction 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics III Data Structures Introduction 10 Elementary Data Structures 11 Hash Tables 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques Introduction 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures Introduction 18 B-Trees 19 Fibonacci Heaps 20 Van Emde Boas Trees 21 Data Structures for Disjoint Sets VI Graph Algorithms Introduction 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics Introduction 27 Multithreaded Algorithms 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical Background Introduction A Summations B Sets, Etc. C Counting and Probability D Matrices Bibliography Index
650			_aComputers / General, Computers / Programming / Algorithms, Computers / Reference, Computers
856			_uhttps://books.google.co.in/books?id=aefUBQAAQBAJ&printsec=frontcover&dq=introduction+to+algorithms+by+cormen&hl=en&sa=X&ved=0ahUKEwi_soi22PXlAhUUiXAKHU0BBLcQ6AEIOjAC#v=onepage&q=introduction%20to%20algorithms%20by%20cormen&f=false
942			_2ddc _cBK _020