about the authors

preface.

1 introduction: some representative problems

1.1 a first problem: stable matching

1.2 five representative problems

solved exercises

excercises

notes and further reading

2 basics of algorithms analysis

2.1 computational tractability

2.2 asymptotic order of growth notation

2.3 implementing the stable matching algorithm using lists and arrays

2.4 a survey of common running times

2.5 a more complex data structure: priority queues

solved exercises

exercises

notes and further reading

3 graphs

3.1 basic definitions and applications

3.2 graph connectivity and graph traversal

等 2100433B