Foundations of Algorithms Using C++ Pseudocode

Front Cover
Jones & Bartlett Learning, 2004 - Computers - 617 pages
Foundations 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

Common terms and phrases

Bibliographic information