Algorithms, 4th Edition

About

Features

• The #1 practical resource for everyone seeking to run programs faster or solve larger problems
• Surveys today's most useful algorithms, with copious illustrations and examples
• Contains many new examples, ranging from physics, biology, and engineering to data compression and web search
• Contains real (not pseudocode) implementations, with detailed performance insights
  
  

Description

The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know

Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.

 Fundamentals:

• Basic programming models
• Data abstraction
• Bags, queues, and stacks
• Analysis of algorithms

 Sorting

• Elementary sorts
• Mergesort
• Quicksort
• Priority queues
• Applications

 Graphs

• Undirected graphs
• Directed graphs
• Minimum spanning trees
• Shortest paths

Strings

• String sorts
• Tries
• Substring search
• Regular expressions
• Data compression

These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them.

Sample Content

Table of Contents

Preface viii

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

2.1 Elementary Sorts 244

2.2 Mergesort 270

2.3 Quicksort 288

2.4 Priority Queues 308

2.5 Applications 336

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

4.1 Undirected Graphs 518

4.2 Directed Graphs 566

4.3 Minimum Spanning Trees 604

4.4 Shortest Paths 638

5.1 String Sorts 702

5.2 Tries 730

5.3 Substring Search 758

5.4 Regular Expressions 788

5.5 Data Compression 810

Updates

Submit Errata