Chapters 1-8, along with additional sections in later chapters, form the basis for an introductory course in algorithms at the undergraduate level. They were written to "interface" with a standard data structures course that is the prerequisite at most schools. Later chapters are appropriate for more advanced study. The book includes an amazing collection of over 200 well-formulated homework problems—several come straight from companies such as Yahoo!^® and Oracle^®. Each problem has been class tested for usefulness and accuracy in the authors' own undergraduate algorithms courses.

• Focus on problem analysis and design techniques.
• Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text.
• Chapters 1-8 and some additional sections in later chapters are designed for use in an undergraduate course. Introductory material accommodates different levels of preparedness at the undergraduate level.
• Over 200 well crafted problems.
• Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms.