## Foundations of Algorithms Using C++ PseudocodeFoundations of Algorithms Using C++ Pseudocode, Third Edition offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts. |

### What people are saying - Write a review

User Review - Flag as inappropriate

i need its exercise solution.

### Contents

Efficiency Analysis and Order | 1 |

CHAPTER | 3 |

CHAPTER | 6 |

APPENDIX | 13 |

DivideandConquer | 47 |

CHAPTER 5 | 80 |

Dynamic Programming | 91 |

CHAPTER 8 | 118 |

Backtracking | 187 |

BranchandBound | 233 |

The Sorting Problem | 267 |

º º | 272 |

º | 289 |

CHAPTER 9 | 308 |

The Searching Problem | 319 |

CHAPTER 10 | 354 |

The Greedy Approach | 137 |

APPENDIX C | 151 |

An Introduction to | 375 |

NumberTheoretic Algorithms | 419 |

### Other editions - View all

Foundations of Algorithms Using C++ Pseudocode Richard E.. Neapolitan,Richard Neapolitan,Kumarss Naimipour No preview available - 2008 |

### Common terms and phrases

0–1 Knapsack problem Algorithm 1.1 algorithm Algorithm Analysis of Algorithm array slot average average-case backtracking algorithm basic operation binary search tree branch-and-bound comparisons of keys Compute decision problem decision tree determine diagonal digits discussed dynamic programming dynamic programming algorithm edge efficient equal example Exchange Sort exercises Figure given greedy algorithm greedy approach heap Heapsort implemented induction input Insertion Sort key type Kruskal's algorithm Lemma loop lower bound maaprofit merge Mergesort minimum spanning tree n-Queens problem node containing nondecreasing order nonpromising nth Fibonacci term number of comparisons number of items number of nodes obtained optimal solution optimal tour pivot item positive integer Prim's algorithm procedure promising proof pruned quadratic Quicksort recursive call root schedule Section sequence shortest path smaller instances solve sorting algorithms space tree subarray subset subtree Theorem total number vertex vertices Visit node weight worst-case time complexity