000			03063nam a22002537a 4500
999			_c760 _d760
005			20211113112945.0
008			200918b ||||| |||| 00| 0 eng d
020			_a9788120340077
082			_a651.8 _bCOR
100			_a Cormen, Thomas H. _91934
245			_aIntroduction to algorithms
250			_a3rd
260			_bPHI Learning Pvt. Ltd. _aNew Delhi _c2020
300			_axix, 1292 p.
365			_aINR _b2195.00
504			_aPreface I Foundations Introduction 1 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
520			_aDescription: This internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added in this edition.
650			_aComputer algorithms _9937
650			_aComputer programming _94337
650			_aAlgorithms _9653
700			_aRivest, Ronald L. _91937
700			_aLeiserson, Charles Eric _91938
942			_2ddc _cBK