## Fundamentals of Computer Algorithms |

### What people are saying - Write a review

User Review - Flag as inappropriate

good

User Review - Flag as inappropriate

This is book is a 'must read' for those who wish to get a clear picture of the various algorithmic techniques.

A variety of problems with ample amount of justification for every step makes it very clear to understand the techniques for solving the problems.

A great book indeed..!

### Contents

ELEMENTARY DATA STRUCTURES | 48 |

DMDEANDCONQUER | 98 |

THE GREEDY METHOD | 152 |

Copyright | |

10 other sections not shown

### Common terms and phrases

adjacency adjacency lists answer node array assignment assume backtracking biconnected components binary search tree binary tree bounding functions branch-and-bound child clique comparisons complete computing contains corresponding decision problem defined delete determine dynamic programming E-node edges elements endif endlf evaluate example exercise formula game tree given graph G greedy Hamiltonian cycle hash Hence heuristic identifiers input insert integer internal nodes iteration knapsack problem leaf nodes live nodes lower bound matrix maximum merge MERGESORT method minimum cost multiplication needed nondeterministic algorithm NP-complete NP-hard obtain operations optimal code optimal solution partition permutation polynomial possible problem instance procedure processor Proof queue QUICKSORT recursive represent requires result rithm schedule Section sequence shortest path Show solved sorted space tree spanning tree stack statement stored subset terminates Theorem traversal tree of Figure tuple undirected graph variables vertex vertices worst Write an algorithm zero