Design and Analysis of Algorithms:Pearson Education India, 1900 - 832 pages Design and Analysis of Algorithms is the outcome of teaching, research and consultancy done by the authors over more than two decades. All aspects pertaining to algorithm design and algorithm analysis have been discussed over the chapters. |
Other editions - View all
Common terms and phrases
abstract data type algorithm amortized amortized analysis analysis array assume binary heap binary search binary tree called Chapter complexity condition consider constant correctness cost data structure defined deletion denote developed dynamic programming edges efficiency element equation example execution expression Fibonacci Fibonacci heap function given graph G greedy algorithm Hamiltonian cycle heap implementation induction initial input insertion integer iterative Key Terms linear loop invariant lower bound matrix mergesort method minimum multiplications natural numbers node notation Note NP-Complete NP-hard operations optimal output parameters pointer polynomial positive integers post-condition prime numbers problem programming language proof rule prove queue random numbers randomized algorithm recurrence relation recursive reduce result root satisfied sequence shortest path solution solve sort stack statement step strategy subset termination Theorem true variables vertex cover vertices