Fundamentals of computer algorithms
Horowitz, Ellis
Fundamentals of computer algorithms - 2nd - Noida: University Press, 2012 - 786p.: 8x15x2; Paperback
About the book: This is the of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. The second edition of Fundamentals of Computer Algorithms emphasizes:
Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
Examples: A wide range of examples provides students with the actual implementation of correct design.
The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
Full integration of randomized algorithms: Performance with non randomized algorithms is thoroughly compared.
9788173716126
Computer Science Engineering
005.73 / HOR/SAH
Fundamentals of computer algorithms - 2nd - Noida: University Press, 2012 - 786p.: 8x15x2; Paperback
About the book: This is the of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. The second edition of Fundamentals of Computer Algorithms emphasizes:
Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
Examples: A wide range of examples provides students with the actual implementation of correct design.
The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
Full integration of randomized algorithms: Performance with non randomized algorithms is thoroughly compared.
9788173716126
Computer Science Engineering
005.73 / HOR/SAH