Foundations Of Algorithms Using C++ Pseudocode [Hardcover]

Richard Neapolitan (Author), Kumarss Naimipour (Author)

Book Description

Publication Date: July 29, 2003 | ISBN-10: 0763723878 | ISBN-13: 978-0763723873 | Edition: 3

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.

Product Details

• Hardcover: 617 pages
• Publisher: Jones & Bartlett Learning; 3 edition (July 29, 2003)
• Language: English
• ISBN-10: 0763723878
• ISBN-13: 978-0763723873
• Product Dimensions: 9.2 x 7.5 x 1.1 inches
• Shipping Weight: 2.2 pounds
• Average Customer Review: 3.7 out of 5 stars  See all reviews (7 customer reviews)
• Amazon Best Sellers Rank: #1,074,933 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

7 of 8 people found the following review helpful:

1.0 out of 5 stars For beginners? Sure., October 6, 2003

By 

Brian Maula "Brian" (Chicago, IL United States) - See all my reviews
(REAL NAME)   

This review is from: Foundations of Algorithms Using C++ Pseudocode, Second Edition (Hardcover)

I attend the school in which these two professors received their tenureship, and I must say, that this book is an absolute disappointment. They state that the reader "require no knowledge of calculus, only College Algebra" yet they go through the theories with little to no explanation, and assuming that the reader knows caculus. The book does a pitiful job of explaining chained matrix multiplication, graph theory, dynamic programming, Diskstra's algorithms, et al. It's NOT the best book, we're using the 3rd edition and it is just as bad as the 2nd edition. There are tons of typos and errors alike.

3 of 3 people found the following review helpful:

1.0 out of 5 stars Awful Textbook, October 26, 2006

By 

ojuice - See all my reviews

This review is from: Foundations Of Algorithms Using C++ Pseudocode (Hardcover)

I'm currently taking a course on Algorithm Analysis, and we're using this as our textbook. At first glance this book seems like a tome of information, and extremely thorough. However, once you start to read it you realize exactly how many errors and typos made it all the way to the Third Edition. On the bright side, the appendices cover discrete mathematics very well.

Here's two samples of the errors that have poked through:

pg. 7, has a grievous error in exchangesort:

for(i=0; i<=1;i++)

That's obviously incorrect. It should be i<=(n-1).

pg. 50, recursive binary search:

else if(x == array[mid])

Again, that should be else if(x <= array[mid]), otherwise the code does the same thing as the previous if statement.

So frankly, skip this book. It contains errors that even a neophyte programmer ought to be able to catch.

5.0 out of 5 stars Great classic at algorithms, March 30, 2011

By 

Yersinio Jimenez Campos (Costa Rica) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: Foundations of Algorithms Using C++ Pseudocode, Second Edition (Hardcover)

This is a excellent book for use in a first course of algorithms using C++ or other similar programming language. Covers usefull themes in a easy way.