Welcome to intro textbooks.

We have selected the best introductory textbooks for high-school students, undergraduates, autodidacts and lifelong learning.

Valid XHTML 1.0 Strict

Computer Science
textbook cover
Introduction to Algorithms

Author: Thomas Cormen, et al.
Publisher: MIT Press, 2003, 1056pp, 2nd ed.

Both rigorous and complete, Cormen's introductory textbook covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms.
Table of contents
Preface
xiii
IFoundations
Introduction3
1The Role of Algorithms in Computing
5
2Getting Started15
3Growth of Functions41
4Recurrences62
5Probabilistic Analysis and Randomized Algorithms91
IISorting and Order Statistics
Introduction123
6Heapsort127
7Quicksort145
8Sorting in Linear Time165
9Medians and Order Statistics183
IIIData Structures
Introduction197
10Elementary Data Structures200
11Hash Tables221
12Binary Search Trees253
13Red-Black Trees273
14Augmenting Data Structures302
IVAdvanced Design and Analysis Techniques
Introduction321
15Dynamic Programming323
16Greedy Algorithms370
17Amortized Analysis405
VAdvanced Data Structures
Introduction431
18B-Trees434
19Binomial Heaps455
20Fibonacci Heaps476
21Data Structures for Disjoint Sets498
VIGraph Algorithms
Introduction525
22Elementary Graph Algorithms527
23Minimum Spanning Trees561
24Single-Source Shortest Paths580
25All-Pairs Shortest Paths620
26Maximum Flow643
VIISelected Topics
Introduction701
27Sorting Networks704
28Matrix Operations725
29Linear Programming770
30Polynomials and the FFT822
31Number-Theoretic Algorithms849
32String Matching906
33Computational Geometry933
34NP-Completeness966
35Approximation Algorithms1022
VIIIAppendix: Mathematical Background
Introduction1057
ASummations1058
BSets, Etc.1070
CCounting and Probability1094