Thomas H. Cormen <br/><br/>
Introduction to algorithms 
Thomas H. Cormen ... [et al.]. 
 - 3rd ed. 
 - Delhi. :  PHI Learning,  2009. 
 - xix,1292 p. :  ill. 
<br/><br/>Includes bibliographical references (p. [1231]-1250) and index. 
<br/><br/>Introduction 3<br/>The Role of Algorithms in Computing 5<br/>1.1 Algorithms 5<br/>1.2 Algorithms as a technology 7 /<br/>Getting Started 16<br/>2.1 Insertion sort 76<br/>2.2 Analyzing algorithms 23<br/>2.3 Designing algorithms 29<br/>Growth of Functions 43<br/>3.1 Asymptotic notation 43<br/>3.2 Standard notations and common functions S3<br/>Divide-and-Conquer 65<br/>4.1 The maximum-subarray problem 68<br/>4.2 Strassen's algorithm for matrix multiplication 75<br/>4.3 The substitution method for solving recurrences 83<br/>4.4 The recursion-tree method for solving recurrences 88<br/>4.5 The master method for solving recurrences 93<br/>4.6 Proof of the master theorem 97<br/>Probabilistic Analysis and Randomized Algorithms 114<br/>5.1 The hiring problem 114<br/>5.2 Indicator random variables 118<br/>5.3 Randomized algorithms 722<br/>5.4 Probabilistic analysis and further uses of indicator random variables<br/>130<br/>II Sorting and Order Statistics<br/>Introduction 147<br/>6  Heapsort 151<br/>6.1 Heaps 151<br/>6.2 Maintaining the heap properly 154<br/>6.3 Building a heap 156<br/>6.4 The heapsort algorithm 159<br/>6.5 Priority queues 162<br/>7  Quicksort 170<br/>7.1 Description of quicksort 170<br/>7.2 Performance of quick.sort 174<br/>7.3 A randomized version of quicksort 179<br/>lA Analysis of quick.sort IHO<br/>8  Sorting in Linear Time 191<br/>8.1 Lower bounds for sorting 191<br/>8.2 Counting sort 194<br/>8.3 Radix sort 197<br/>8.4 Bucket sort 200<br/>9  Medians and Order Statistics 213<br/>III Data Structures<br/>9.1 Minimum and maximum 214<br/>9.2 Selection in expected linear time 215<br/>9.3 Selection in worst-case linear time 220<br/>Introduction 229<br/>10 Elementary Data Structures 232<br/>10.1 Stacks and queues 232<br/>10.2 Linked lists 236<br/>10.3 Implementing pointers and objects 241<br/>10.4 Representing rooted trees 246<br/>11 Hash Tables 253<br/>11.1 Direct-address tables 254<br/>11.2 Hash tables 256<br/>11.3 Hash functions 262<br/>11.4 Open addressing 269<br/>★  11.5 Perfect hashing 277<br/>12 Binary Search TYees 286<br/>12.1 What is a binary search tree? 286<br/>12.2 Querying a binary .search tree 289<br/>12..^ Insertion and deletion 294<br/>★  12.4 Randomly built binary search trees 299<br/>13 Red-Black Trees 308<br/>13.1 Properties of" red-black trees 308<br/>13.2 Rotations 312<br/>13.3 Insertion 315<br/>13.4 Deletion 323<br/>14 Augmenting Data Structures 339<br/>14.1 Dynamic order statistics 339<br/>14.2 How to augment a data .structure 345<br/>14.3 Interval trees 348<br/>IV Advanced Design and Analysis Techniques<br/>Introduction 357<br/>15 Dynamic Programming 359<br/>15.1 Rod cutting 360<br/>15.2 Matrix-chain multiplication 370<br/>15.3 Elements of dynamic programming 378<br/>15.4 Longest common subsequence 390<br/>15.5 Optimal binary search trees 397<br/>16 Greedy Algorithms 414<br/>16.1 An activity-selection problem 415<br/>16.2 Elements of the greedy strategy 423<br/>16.3 Huffman codes 428<br/>★  16.4 Matroids and greedy methods 437<br/>★  16.5 A task-scheduling problem as a matroid 443<br/>17 Amortized Analysis 451<br/>17.1 Aggregate analysis 452<br/>17.2 The accounting m.ethod 456<br/>17.3 The potential method 459<br/>17.4 Dynamic tables 463<br/>V Advanced Data Structures<br/>Introduction 481<br/>18 B-Trees 484<br/>18.1 Delinilion of B-trees 4H8<br/>18.2 Basic operations on B-trees 491<br/>18.3 Deleting a key from a B-trec 499<br/>19 Fibonacci Heaps 505<br/>19.1 Structure of Fibonacci heaps 507<br/>19.2 Mergeable-heap operations 510<br/>19.3 Decreasing a key and deleting a node 518<br/>19.4 Bounding the maximum degree 523<br/>20 van Emde Boas Trees 531<br/>20.1 Preliminary approaches 532<br/>20.2 A recursive structure 536<br/>20.3 The van Emde Boas tree 545<br/>21 Data Structures for Disjoint Sets 561<br/>21.1 Disjoint-set operations 56/<br/>21.2 Linked-list representation of disjoint sets 564<br/>21.3 Disjoint-set forests 568<br/>★  21.4 Analysis of union by rank with path compression 573<br/>VI Graph Algorithms<br/>Introduction 587<br/>22 Elementary Graph Algorithms 589<br/>22.1 Representations of graphs 589<br/>22.2 Breadth-first search 594<br/>22.3 Depth-first search 603<br/>22.4 Topological sort 612<br/>22.5 Strongly connected components 615<br/>23 Minimum Spanning Trees 624<br/>23.1 Growing a minimum spanning tree 625<br/>23.2 The algorithms of Kruskal and Prim 631<br/>24 Single-Source Shortest I'atlis 643<br/>24.1 The Bcilman-Forcl aljzorilhm 65/<br/>24.2 Single-source shortest jxiths in directed acyclic graphs 6.s5<br/>24.3 Dijkstra's algorithm 6.5(S'<br/>24.4 DilTerence constraints and shortest paths 664<br/>24.5 Proofs of shortest-paths properties 67/<br/>25 All-Pairs Shorte.st Paths 6H4<br/>25.1 Shortest paths and matri.x multiplication 6.S'6<br/>25.2 The Floyd-Warshall algorithm 693<br/>25.3 Johnson's algorithm for sparse graphs 700<br/>26 Maximum Flow 708<br/>26.1 Flow networks 709<br/>26.2 The Ford-Fulkerson method 7/4<br/>26.3 Maximum bipartite matching 732<br/>★  26.4 Push-relabel algorithms 736<br/>★  26.5 The relabel-to-front algorithm 748<br/>VII Selected Topics<br/>Introduction 769<br/>27 Multithreaded Algorithms 772 ,<br/>27.1 The basics of dynamic multithreading 774<br/>27.2 Multithreaded matrix multiplication 792<br/>27.3 Multithreaded merge sort 797<br/>28 Matrix Operations 813<br/>28.1 Solving systems of linear equations 813<br/>28.2 Inverting matrices 827<br/>28.3 Symmetric positive-definite matrices and least-squares approximation<br/>832<br/>29 Linear Programming 843<br/>29.1 Standard and slack forms 850<br/>29.2 Formulating problems as linear programs 859<br/>29.3 The simplex algorithm 864<br/>29.4 Duality 879<br/>29.5 The initial basic feasible solution 886<br/>30 Polynomials and the FfT 898<br/>30.1 Representing polynomials 900<br/>30.2 The DFT and FFT 906<br/>30.3 Efficient FFT implementations 915<br/>31 Number-Theoretic Algorithms 926<br/>31.1 Elementary number-theoretic notions 927<br/>31.2 Greate.st common divisor 933<br/>31.3 Modular arithmetic 939<br/>31.4 Solving modular linear equations 946<br/>31.5 The Chine.se remainder theorem 950<br/>31.6 Powers of an element 954<br/>31.7 The RSA public-key cryptosystem 958<br/>★  31.8 Primality testing 965<br/>★  31.9 Integer factorization 975<br/>32 String Matching 985<br/>32.1 The naive .string-matching algorithm 988<br/>32.2 The Rabin-Karp algorithm 990<br/>32.3 String matching with finite automata 995<br/>★  32.4 The Knuth-Morris-Pratt algorithm 1002<br/>33 Computational Geometry 1014<br/>33.1 Line-segment properties I0I5<br/>33.2 Determining whether any pair of segments intersects 1021<br/>33.3 Finding the convex hull 1029<br/>33.4 Finding the closest pair of points 1039<br/>34 NP-Completeness 1048<br/>34.1 Polynomial time 1053<br/>34.2 Polynomial-time verification 1061<br/>34.3 NP-completeness and reducibility 1067<br/>34.4 NP-completeness proofs 1078<br/>34.5 NP-complete problems 1086<br/>35 Approximation Algorithms 1106<br/>35.1 The vertex-cover problem 1108<br/>35.2 The traveling-salesman problem 1111<br/>35.3 The set-covering problem 1117<br/>35.4 Randomization and linear programming 1123<br/>35.5 The subset-sum problem 1128 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer Programming.<br/>Computer Algorithms.
<br/><br/><label>Dewey Class. No.: </label>005.1  / COR/I