|
Introduction to Algorithms 2nd Edition
Written by top researchers, this text blends theory and practice. It covers the modern topics of parallel algorithms, concurrency and recurrency. A McGraw-Hill/MIT Press collaboration, the text is designed for both the instructor and the student. It offers a flexible organization with self-contained chapters, and it provides an introduction to the
necessary mathematical analysis. Introduction to Algorithms contains sections that gently introduce mathematical techniques for students who may need help. This material takes students at an elementary level of mathematical sophistication and raises them to a level allowing them to solve algorithmic problems. Simple, easy-to-do exercises, as well as more thoughtful, step-by-step case-generated problems are included. The book features standard analytic notation and includes trimmed-down, easy-to-read pseudocode.
PART ONE: ANALYSIS TOOLS
PART TWO: SORTING AND ORDER STATISTICS
PART THREE: ELEMENTARY DATA STRUCTURES
PART FOUR: ADVANCED DESIGN AND ANALYSIS TECHNIQUES
PART FIVE: ADVANCED DATA STRUCTURES
PART SIX: GRAPH ALGORITHMS
PART SEVEN: MATRIX AND POLYNOMIAL COMPUTATIONS
PART EIGHT: PARALLEL ALGORITHMS
|
