Hot Best Seller

Computer Algorithms

Availability: Ready to download

This text, covering Pseudocode programs, takes a solid, theoretical approach to computer algorithms and lays a basis for more in-depth study, while providing opportunities for hands-on learning. The emphasis is on design technique, and there are up-to-date examples illustrating design strategies.


Compare

This text, covering Pseudocode programs, takes a solid, theoretical approach to computer algorithms and lays a basis for more in-depth study, while providing opportunities for hands-on learning. The emphasis is on design technique, and there are up-to-date examples illustrating design strategies.

30 review for Computer Algorithms

  1. 4 out of 5

    Qubitng

    The prose is too abstract for a first course algorithms book. Consider the hideous abstract description of the binary search algorithm in Chpt 3 as the normal approach for the book. As a student I generally prefer concrete motivations, idea or examples followed by abstraction and algorithm. Also this book strangely doesn't bother talking about Turing machines though it talks about P/NP problems. It also omits red-black trees, B-trees, and other balancing algorithms. Instead it has 3 chapters on The prose is too abstract for a first course algorithms book. Consider the hideous abstract description of the binary search algorithm in Chpt 3 as the normal approach for the book. As a student I generally prefer concrete motivations, idea or examples followed by abstraction and algorithm. Also this book strangely doesn't bother talking about Turing machines though it talks about P/NP problems. It also omits red-black trees, B-trees, and other balancing algorithms. Instead it has 3 chapters on inter-processor algorithms. On a positive side, it generously covers dynamic programming in multiple chapters with many examples and exercises. Fortunately I'm only using this book as a refresher for which it actually works well. A very nice plus is that it contains a large number of exercises. But to future teachers, please don't torture your poor undergrad students with such text; it turns them off to an otherwise interesting and important subject matter.

  2. 5 out of 5

    Rithik

  3. 5 out of 5

    Abdul Rauf

  4. 5 out of 5

    Kyle Robinson

  5. 4 out of 5

    Kevin K Bauer

  6. 5 out of 5

    Kiran Kulkarni

  7. 4 out of 5

    Mona Ali

  8. 5 out of 5

    Asim

  9. 4 out of 5

    Rohini

  10. 5 out of 5

    Lộc Đặng

  11. 5 out of 5

    Pallavi Rana

  12. 4 out of 5

    Amin

  13. 4 out of 5

    Will Angley

  14. 4 out of 5

    V

  15. 4 out of 5

    Evgeny

  16. 5 out of 5

    tony

  17. 5 out of 5

    ANKAN

  18. 4 out of 5

    James

  19. 5 out of 5

    Liam

  20. 5 out of 5

    FleshyShowoff

  21. 4 out of 5

    Abdul

  22. 4 out of 5

    Luke Van

  23. 5 out of 5

    Luke Van

  24. 4 out of 5

    Ritesh Nayak

  25. 4 out of 5

    Subhajit Das

  26. 4 out of 5

    Rahul Kumar

  27. 5 out of 5

    Oscar Joseph

  28. 5 out of 5

    Albert Kipruto

  29. 5 out of 5

    Tanmay Patil

  30. 5 out of 5

    Ashish Arora

Add a review

Your email address will not be published. Required fields are marked *

Loading...