
FUNDAMENTALS OF COMPUTER ALGORITHMS
Author: Horowitz, Sahni
Brand: Orient Blackswan
Edition: Second
Features:
- Binding : paperback
- Language : english
- Publication date : 2008-05-01
- Authors : ellis horowitz, sartaj sahni, sanguthevar rajasekaran
Binding: unknown_binding
Format: organizer
Number Of Pages: 808
Release Date: 01-01-2008
Part Number: 11802
Details: 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 nonrandomized algorithms is thoroughly compared.
EAN: 9788173716126
Package Dimensions: 9.4 x 6.3 x 1.3 inches
Languages: English
Original: $7.82
-65%$7.82
$2.74Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
Author: Horowitz, Sahni
Brand: Orient Blackswan
Edition: Second
Features:
- Binding : paperback
- Language : english
- Publication date : 2008-05-01
- Authors : ellis horowitz, sartaj sahni, sanguthevar rajasekaran
Binding: unknown_binding
Format: organizer
Number Of Pages: 808
Release Date: 01-01-2008
Part Number: 11802
Details: 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 nonrandomized algorithms is thoroughly compared.
EAN: 9788173716126
Package Dimensions: 9.4 x 6.3 x 1.3 inches
Languages: English


















