Introduction to Algorithms, First Edition(1990) Thomas H. Cormen Charles E. Leiserson Ronald L.

Rivest Table of Contents Preface

1 Introduction 1.1 Algorithms 1.2 Analyzing algorithms 1.3 Designing algorithms 1.4 Summary I Mathematical Foundations Introduction 2 ro!th of "unctions 2.1 Asymptotic notation 2.2 Standard notations and common functions # $ummations 3.1 Summation formulas and properties 3.2 Bounding summations % Recurrences 4.1 The substitution method 4.2 The iteration method 4.3 The master method 4.4 roof of the master theorem & $ets, Etc. !.1 Sets !.2 "elations !.3 #unctions !.4 $raphs !.! Trees ' Counting and Pro(a(ilit) %.1 &ounting %.2 robability %.3 Discrete random 'ariables %.4 The geometric and binomial distribution %.! The tails of the binomial distribution %.% robabilistic analysis II Sorting and Order Statistics Introduction * Hea+sort (.1 )eaps (.2 *aintaining the heap property (.3 Building a heap (.4 The heapsort algorithm (.! riority +ueues , -uic.sort

,.1 Description of +uic-sort ,.2 erformance of +uic-sort ,.3 "andomized 'ersions of +uic-sort ,.4 Analysis of +uic-sort / $orting in Linear Time ..1 /o0er bounds for sorting ..2 &ounting sort ..3 "adi1 sort ..4 Buc-et sort 10 1edians and 2rder $tatistics 12.1 *inimum and ma1imum 12.2 Selection in e1pected linear time 12.3 Selection in 0orst3case linear time III Data Structures Introduction 11 Elementar) 3ata $tructures 11.1 Stac-s and +ueues 11.2 /in-ed lists 11.3 4mplementing pointers and ob5ects 11.4 "epresenting rooted trees 12 Hash Ta(les 12.1 Direct3address tables 12.2 )ash tables 12.3 )ash functions 12.4 6pen addressing 1# 4inar) $earch Trees 13.1 7hat is a binary search tree8 13.2 9uerying a binary search tree 13.3 4nsertion and deletion 13.4 "andomly built binary search trees 1% Red54lac. Trees 14.1 roperties of red3blac- trees 14.2 "otations 14.3 4nsertion 14.4 Deletion 1& Augmenting 3ata $tructures 1!.1 Dynamic order statistics 1!.2 )o0 to augment a data structure 1!.3 4nter'al trees IV Advanced Design and Anal sis !echni"ues Introduction 1' 3)namic Programming 1%.1 *atri13chain multiplication 1%.2 :lements of dynamic programming 1%.3 /ongest common subse+uence 1%.4 6ptimal polygon triangulation 1* reed) Algorithms 1(.1 An acti'ity3selection problem 1(.2 :lements of the greedy strategy 1(.3 )uffman codes 1(.4 Theoretical foundations for greedy methods

1(.! A tas-3scheduling problem 1, Amorti6ed Anal)sis 1,.1 The aggregate method 1,.2 The accounting method 1,.3 The potential method 1,.4 Dynamic tables V Advanced Data Structures Introduction 1/ 45Trees 1/.1 3efinition of 45trees 1/.2 4asic o+erations on 45trees 1/.# 3eleting a .e) from a 45tree 20 4inomial Hea+s 20.1 4inomial trees and (inomial hea+s 20.2 2+erations on (inomial hea+s 21 "i(onacci Hea+s 21.1 $tructure of "i(onacci hea+s 21.2 1ergea(le5hea+ o+erations 21.# 3ecreasing a .e) and deleting a node 21.% 4ounding the ma7imum degree 22 3ata $tructures for 3is8oint $ets 22.1 3is8oint5set o+erations 22.2 Lin.ed5list re+resentation of dis8oint sets 22.# 3is8oint5set forests 22.% Anal)sis of union () ran. !ith +ath com+ression VI #ra$h Algorithms Introduction 2# Elementar) ra+h Algorithms 2#.1 Re+resentations of gra+hs 2#.2 4readth5first search 2#.# 3e+th5first search 2#.% To+ological sort 2#.& $trongl) connected com+onents 2% 1inimum $+anning Trees 2%.1 ro!ing a minimum s+anning tree 2%.2 The algorithms of 9rus.al and Prim 2& $ingle5$ource $hortest Paths 2&.1 $hortest +aths and rela7ation 2&.2 3i8.stra:s algorithm 2&.# The 4ellman5"ord algorithm 2&.% $ingle5source shortest +aths in directed ac)clic gra+hs 2&.& 3ifference constraints and shortest +aths 2' All5Pairs $hortest Paths 2'.1 $hortest +aths and matri7 multi+lication 2'.2 The "lo)d5;arshall algorithm 2'.# <ohnson:s algorithm for s+arse gra+hs 2'.% A general frame!or. for solving +ath +ro(lems in directed gra+hs 2* 1a7imum "lo! 2*.1 "lo! net!or.s 2*.2 The "ord5"ul.erson method 2*.# 1a7imum (i+artite matching

2*.% Preflo!5+ush algorithms 2*.& The lift5to5front algorithm VII Selected !o$ic Introduction 2, $orting =et!or.s 2,.1 Com+arison net!or.s 2,.2 The 6ero5one +rinci+le 2,.# A (itonic sorting net!or. 2,.% A merging net!or. 2,.& A sorting net!or. 2/ Arithmetic Circuits 2/.1 Com(inational circuits 2/.2 Addition circuits 2/.# 1ulti+lication circuits 2/.% Cloc.ed circuits #0 Algorithms for Parallel Com+uters #0.1 Pointer 8um+ing #0.2 CRC; algorithms versus ERE; algorithms #0.# 4rent:s theorem and !or. efficienc) #0.% ;or.5efficient +arallel +refi7 com+utation #0.& 3eterministic s)mmetr) (rea.ing #1 1atri7 2+erations #1.1 Pro+erties of matrices #1.2 $trassen:s algorithm for matri7 multi+lication #1.# Alge(raic num(er s)stems and (oolean matri7 multi+lication #1.% $olving s)stems of linear e>uations #1.& Inverting matrices #1.' $)mmetric +ositive5definite matrices and least5s>uares a++ro7imation #2 Pol)nomials and the ""T #2.1 Re+resentation of +ol)nomials #2.2 The 3"T and ""T #2.# Efficient ""T im+lementation ## =um(er5Theoretic Algorithms ##.1 Elementar) num(er5theoretic notions ##.2 reatest common divisor ##.# 1odular arithmetic ##.% $olving modular linear e>uations ##.& The Chinese remainder theorem ##.' Po!ers of an element ##.* The R$A +u(lic5.e) cr)+tos)stem ##., Primalit) testing ##./ Integer factori6ation #% $tring 1atching #%.1 The naive string5matching algorithm #%.2 The Ra(in59ar+ algorithm #%.# $tring matching !ith finite automata #%.% The 9nuth51orris5Pratt algorithm #%.& The 4o)er51oore algorithm #& Com+utational eometr) #&.1 Line5segment +ro+erties #&.2 3etermining !hether an) +air of segments intersects #&.# "inding the conve7 hull #&.% "inding the closest +air of +oints

#' =P5Com+leteness #'.1 Pol)nomial time #'.2 Pol)nomial5time verification #'.# =P5com+leteness and reduci(ilit) #'.% =P5com+leteness +roofs #'.& =P5com+lete +ro(lems #* A++ro7imation Algorithms #*.1 The verte75cover +ro(lem #*.2 The traveling5salesman +ro(lem #*.# The set5covering +ro(lem #*.% The su(set5sum +ro(lem 4i(liogra+h) Inde7