Algorithms

by ;
Edition: 4th
Format: Hardcover
Pub. Date: 2011-03-24
Publisher(s): Addison-Wesley Professional
List Price: $89.99

Buy New

Usually Ships in 2-3 Business Days
$87.29

Buy Used

Usually Ships in 24-48 Hours
$69.36

Rent Book

Select for Price
There was a problem. Please try again later.

Rent Digital eBook

Online: 1825 Days
Downloadable: Lifetime Access
$80.99
$80.99

This item is being sold by an Individual Seller and will not ship from the Online Bookstore's warehouse. The Seller must confirm the order within two business days. If the Seller refuses to sell or fails to confirm within this time frame, then the order is cancelled.

Please be sure to read the Description offered by the Seller.


Customer Reviews

Excellent textbook on basic algorithms  April 2, 2011
by
Rating StarRating StarRating StarRating StarRating Star

This textbook presents an interesting challenge. It talks about algorithms yet it does not present algorithms, nor does it define algorithm as anything more than a "problem-solving method suitable for implementation as computer programs [p.4]." Instead, it exhibits programs which are the implementations of algorithms and discusses them as if the algorithm is apparent. The reader is left with the challenge of learning to discriminate between what is essential about an algorithm and how to preserve that in an implementation, versus what is inessential to the algorithm and introduced on account of the implementation and the use of particular programming tools.






Algorithms: 5 out of 5 stars based on 1 user reviews.

Summary

Essential Information that Every Serious Programming Student Needs to Know about Algorithms and Data Structures #xA0; A Classic Reference The latest version of Sedgewick#x19;s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. #xA0; Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, string processing, and geometric applications, including fifty algorithms every programmer should know. Seewww.cs.princeton.edu/algs4/top50. #xA0; Completely Revised Code New Java implementations written in an accessible, modular programming style, where all of the code is exposed to the reader and ready to use. New versions of quicksort, LZW compression, red-black tree search, RE pattern matching, and many other algorithms. #xA0; Engages with Applications Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books. #xA0; Intellectually Stimulating Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels. #xA0; A Scientific Approach Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models. #xA0; Integrated with the Web Visitwww.cs.princeton.edu/algs4for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

Author Biography

Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

 

Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

Table of Contents

Preface viii

 

Chapter 1: Fundamentals 3

1.1 Basic Programming Model 8

1.2 Data Abstraction 64

1.3 Bags, Queues, and Stacks 120

1.4 Analysis of Algorithms 172

1.5 Case Study: Union-Find 216

 

Chapter 2: Sorting 243

2.1 Elementary Sorts 244

2.2 Mergesort 270

2.3 Quicksort 288

2.4 Priority Queues 308

2.5 Applications 336

 

Chapter 3: Searching 361

3.1 Symbol Tables 362

3.2 Binary Search Trees 396

3.3 Balanced Search Trees 424

3.4 Hash Tables 458

3.5 Applications 486

 

Chapter 4: Graphs 515

4.1 Undirected Graphs 518

4.2 Directed Graphs 566

4.3 Minimum Spanning Trees 604

4.4 Shortest Paths 638

 

Chapter 5: Strings 695

5.1 String Sorts 702

5.2 Tries 730

5.3 Substring Search 758

5.4 Regular Expressions 788

5.5 Data Compression 810

 

Chapter 6: Context 853

 

Index 933

List of Algorithms 954

List of Clients 955

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.