Introduction to the design and analysis of algorithms ,3rd edition written by Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee was published in the year 2011. It has details on algorithm design, algorithm analysis, Algorithm Efficiency, Algorithm Efficiency analysis, Brute Force, Exhaustive Search, Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer, Space and Time Trade-Offs, Dynamic Programming, Greedy Technique, Iterative Improvement, Algorithm Power, Algorithmic Problem Solving, Nonrecursive Algorithms mathematical analysis, recursive Algorithms mathematical analysis, Selection Sort, Bubble Sort, Sequential Search, Brute-Force String Matching, Closest-Pair Problems, Convex-Hull Problems, depth-First Search, Breadth-First Search, Insertion Sort, Topological Sorting, Variable-Size-Decrease Algorithms, Decrease-by-a-Constant-Factor Algorithms, binary search, Mergesort, quicksort, Binary Tree Traversals, Strassen’s Matrix Multiplication, Gaussian Elimination, presorting, Balanced Search Trees, Heaps, Heapsort, Horner’s Rule, Binary Exponentiation, Problem Reduction, B-Trees, hashing, Knapsack Problem, Optimal Binary Search Trees, Warshall’s Algorithm, Floyd’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees, huffman Codes, Simplex Method, Maximum-Flow Problem, Stable Marriage Problem, Lower-Bound Arguments, Decision Trees, Numerical Algorithms, Backtracking, Approximation Algorithms .
This book was uploaded for 200 level Science and Technology students of University of Ibadan. it is recommended for CSC242 course .
|Uploaded by: User|
|Uploaded on: 13-January-2021|
|Size: 2.39 MB|
|Number of points needed for download: 65|
|Number of downloads: 0|
Will you help us reach more students?