Table of Contents

Chapter 1 Elements of Programming
1.1 Your First Program
1.2 Built-in Types of Data
1.3 Conditionals and Loops
1.4 Arrays
1.5 Input and Output
1.6 Case Study: Random Web Surfer

Chapter 2 Functions and Modules
2.1 Static Methods
2.2 Libraries and Clients
2.3 Recursion
2.4 Case Study: Percolation

Chapter 3 Object-Oriented Programming
3.1 Data Types
3.2 Creating Data Types
3.3 Designing Data Types
3.4 Case Study: N-body Simulation

Chapter 4 Algorithms and Data Structures
4.1 Performance
4.2 Sorting and Searching
4.3 Stacks and Queues
4.4 Symbol Tables
4.5 Case Study: Small World

Context
Index

About the Author

Robert Sedgewick teaches in the Department of Computer Science at Princeton University. His primary areas of research are analytic combinatorics and the design, analysis, and implementation of algorithms. He is the author of a widely-used series on algorithms published by Addison-Wesley Professional. Sedgewick is on the Board of Directors for Adobe Systems Incorporated.

Kevin Wayne also teaches in the Department of Computer Science at Princeton University. His research focuses on theoretical computer science, especially optimization and the design, analysis, and implementation of computer algorithms. Wayne received his PhD from Cornell University.