Logo

Algorithms by Robert Sedgewick, Kevin Wayne

Large book cover: Algorithms

Algorithms
by

Publisher: Addison-Wesley Professional
ISBN/ASIN: 032157351X
ISBN-13: 9780321573513
Number of pages: 976

Description:
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications.

Home page url

Download or read it online for free here:
Read online
(online reading)

Similar books

Book cover: Problem Solving with Algorithms and Data Structures Using PythonProblem Solving with Algorithms and Data Structures Using Python
by - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(7418 views)
Book cover: Lecture Notes on Bucket AlgorithmsLecture Notes on Bucket Algorithms
by - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(7427 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(10457 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(12196 views)