Organizes algorithmic topics in a logical order from basic to advanced.

Presents concepts in clear, student-friendly language.

Offers worked-out examples for many of the algorithms presented throughout the text.

Includes both pseudo-code and complete program code for many algorithms.

Provides different possible algorithms for the same problem.

Includes numerous solved and unsolved exercises within each chapter.

Problems presented in the text are written in C#, however students who run Java can still utilize these C# programs.