Introduction to Algorithms ,3rd Edition written by Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein was published in the year 2009. It has details on Algorithms, Insertion sort, analyzing Algorithms, designing Algorithms, growth of functions, asymototic notation, maximum-subarray problem, Strassen’s algorithm, Probabilistic Analysis, Randomized Algorithms, hiring problem, Indicator random variables, Heapsort, heaps, heapsort algorithm, Priority queues, quicksort, Radix sort, Counting sort, Bucket sort, Data Structures, Hash Tables, has function, open addressing, Perfect hashing, Data Structures, sorting order statistics, Binary Search Trees, Red-Black Trees, Augmenting Data Structures, Dynamic Programming, Greedy Algorithms, Amortized Analysis, B-Trees, Fibonacci Heaps, van Emde Boas Trees, Graph Algorithms, Minimum Spanning Trees, Single-Source Shortest Paths, All-Pairs Shortest Path, maximum flow, Multithreaded Algorithms, Matrix Operations, linear programming, polynomials, Number-Theoretic Algorithms, String Matching, Computational Geometry, NP-Completeness, Polynomial time, Approximation Algorithms.
This book was uploaded for 200 level Science students of University of Ibadan. it is recommended for CSC242 course.
|Uploaded by: Admin|
|Uploaded on: 13-January-2021|
|Size: 5.04 MB|
|Number of points needed for download: 8|
|Number of downloads: 0|
Find this helpful? You can share to your friends