A Practical Introduction to Data Structures and Algorithm Analysis

More documents

Recommendations

Info

PART IIFundamental <strong>Data</strong> <strong>Structures</strong>97
Page 15 and 16:
xviPrefacemake the examples as clea
Page 17 and 18:
xviiiPrefaceOne of the most importa
Page 19 and 20:
xxPrefaceOthers at Prentice Hall wh
Page 22 and 23:
1Data Structures and AlgorithmsHow
Page 24 and 25:
Sec. 1.1 A Philosophy of Data Struc
Page 26 and 27:
Sec. 1.1 A Philosophy of Data Struc
Page 28 and 29:
Sec. 1.2 Abstract Data Types and Da
Page 30 and 31:
Sec. 1.2 Abstract Data Types and Da
Page 32 and 33:
Sec. 1.3 Design Patterns 13Data Typ
Page 34 and 35:
Sec. 1.3 Design Patterns 151.3.3 Co
Page 36 and 37:
Sec. 1.4 Problems, Algorithms, and
Page 38 and 39:
Sec. 1.5 Further Reading 194. It mu
Page 40 and 41:
Sec. 1.6 Exercises 21If you want to
Page 42 and 43:
Sec. 1.6 Exercises 231.12 Imagine t
Page 44 and 45:
2Mathematical PreliminariesThis cha
Page 46 and 47:
Sec. 2.1 Sets and Relations 27examp
Page 48 and 49:
Sec. 2.2 Miscellaneous Notation 29x
Page 50 and 51:
Sec. 2.3 Logarithms 31positive inte
Page 52 and 53:
Sec. 2.4 Summations and Recurrences
Page 54 and 55:
Sec. 2.4 Summations and Recurrences
Page 56 and 57:
Sec. 2.5 Recursion 37factorial of n
Page 58 and 59:
Sec. 2.6 Mathematical Proof Techniq
Page 60 and 61:
Page 62 and 63:
Page 64 and 65: Sec. 2.6 Mathematical Proof Techniq
Page 66 and 67: Sec. 2.7 Estimating 47Example 2.17
Page 68 and 69: Sec. 2.8 Further Reading 49typical
Page 70 and 71: Sec. 2.9 Exercises 51(f) {〈2, 1
Page 72 and 73: Sec. 2.9 Exercises 532.17 Prove by
Page 74 and 75: Sec. 2.9 Exercises 552.38 When buyi
Page 76 and 77: 3Algorithm AnalysisHow long will it
Page 78 and 79: Sec. 3.1 Introduction 59compiled wi
Page 80 and 81: Sec. 3.1 Introduction 61Example 3.3
Page 82 and 83: Sec. 3.2 Best, Worst, and Average C
Page 84 and 85: Sec. 3.3 A Faster Computer, or a Fa
Page 86 and 87: Sec. 3.4 Asymptotic Analysis 67comp
Page 88 and 89: Sec. 3.4 Asymptotic Analysis 69fast
Page 90 and 91: Sec. 3.4 Asymptotic Analysis 71Exam
Page 92 and 93: Sec. 3.4 Asymptotic Analysis 73Rule
Page 94 and 95: Sec. 3.5 Calculating the Running Ti
Page 96 and 97: Sec. 3.5 Calculating the Running Ti
Page 98 and 99: Sec. 3.6 Analyzing Problems 79binar
Page 100 and 101: Sec. 3.7 Common Misunderstandings 8
Page 102 and 103: Sec. 3.9 Space Bounds 83pixel. Assu
Page 104 and 105: Sec. 3.9 Space Bounds 85A classic e
Page 106 and 107: Sec. 3.10 Speeding Up Your Programs
Page 108 and 109: Sec. 3.11 Empirical Analysis 893.11
Page 110 and 111: Sec. 3.13 Exercises 913.3 Arrange t
Page 112 and 113: Sec. 3.13 Exercises 93(f) sum = 0;f
Page 114: Sec. 3.14 Projects 95a summation fo
Page 119 and 120: 100 Chap. 4 Lists, Stacks, and Queu
Page 165 and 166:
146 Chap. 4 Lists, Stacks, and Queu
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
154 Chap. 5 Binary TreesABCDEFGHIFi
Page 175 and 176:
156 Chap. 5 Binary TreesAny number
Page 177 and 178:
158 Chap. 5 Binary Trees/** ADT for
Page 179 and 180:
160 Chap. 5 Binary TreesFunction pr
Page 181 and 182:
162 Chap. 5 Binary Trees205040 7520
Page 183 and 184:
164 Chap. 5 Binary Trees/** Binary
Page 185 and 186:
166 Chap. 5 Binary Treespublic inte
Page 187 and 188:
168 Chap. 5 Binary Treespublic inte
Page 189 and 190:
170 Chap. 5 Binary TreesIf P = D, t
Page 191 and 192:
172 Chap. 5 Binary Trees012345 678
Page 193 and 194:
174 Chap. 5 Binary Treesimport java
Page 195 and 196:
176 Chap. 5 Binary Trees37244273240
Page 197 and 198:
178 Chap. 5 Binary Treessubroot105
Page 199 and 200:
180 Chap. 5 Binary Treesin the case
Page 201 and 202:
182 Chap. 5 Binary TreesMin-heaps a
Page 203 and 204:
184 Chap. 5 Binary Trees/** Put ele
Page 205 and 206:
186 Chap. 5 Binary Trees172 34645 6
Page 207 and 208:
188 Chap. 5 Binary Treeswhen search
Page 209 and 210:
190 Chap. 5 Binary TreesLetter C D
Page 211 and 212:
192 Chap. 5 Binary Trees3060 1120 1
Page 213 and 214:
194 Chap. 5 Binary Treesclass HuffT
Page 215 and 216:
196 Chap. 5 Binary TreesLetter Freq
Page 217 and 218:
198 Chap. 5 Binary Treesits occurri
Page 219 and 220:
200 Chap. 5 Binary Treesprints the
Page 221 and 222:
202 Chap. 5 Binary Trees5.29 What w
Page 223 and 224:
204 Chap. 5 Binary Trees5.5 Impleme
Page 225 and 226:
206 Chap. 6 Non-Binary TreesRootRAn
Page 227 and 228:
208 Chap. 6 Non-Binary TreesRABCD E
Page 229 and 230:
210 Chap. 6 Non-Binary Treesobjects
Page 231 and 232:
212 Chap. 6 Non-Binary TreesRWABXYZ
Page 233 and 234:
214 Chap. 6 Non-Binary Treesusing t
Page 235 and 236:
216 Chap. 6 Non-Binary Trees5 0 0 5
Page 237 and 238:
218 Chap. 6 Non-Binary TreesRA BC D
Page 239 and 240:
220 Chap. 6 Non-Binary TreesRVal Si
Page 241 and 242:
222 Chap. 6 Non-Binary TreesRARCBAB
Page 243 and 244:
224 Chap. 6 Non-Binary TreesABCDEFG
Page 245 and 246:
226 Chap. 6 Non-Binary Treeswill us
Page 247 and 248:
228 Chap. 6 Non-Binary Trees6.9 Dev
Page 249 and 250:
230 Chap. 6 Non-Binary Trees6.8 Pro
Page 252:
PART IIISorting and Searching233
Page 255 and 256:
236 Chap. 7 Internal Sortingand Qui
Page 257 and 258:
238 Chap. 7 Internal Sorting4220171
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
244 Chap. 7 Internal Sorting7.3 She
Page 265 and 266:
246 Chap. 7 Internal SortingSome ch
Page 267 and 268:
248 Chap. 7 Internal Sortingsubarra
Page 269 and 270:
250 Chap. 7 Internal Sortingsort ro
Page 271 and 272:
252 Chap. 7 Internal Sortingstatic
Page 273 and 274:
254 Chap. 7 Internal Sortinghappens
Page 275 and 276:
256 Chap. 7 Internal SortingA simpl
Page 277 and 278:
258 Chap. 7 Internal SortingOrigina
Page 279 and 280:
260 Chap. 7 Internal Sortingthat ea
Page 281 and 282:
262 Chap. 7 Internal SortingAs with
Page 283 and 284:
264 Chap. 7 Internal SortingOne cou
Page 285 and 286:
266 Chap. 7 Internal SortingSort 10
Page 287 and 288:
268 Chap. 7 Internal Sortingcompari
Page 289 and 290:
270 Chap. 7 Internal Sortingcompare
Page 291 and 292:
272 Chap. 7 Internal Sorting7.11 Ex
Page 293 and 294:
274 Chap. 7 Internal Sorting7.13 Gr
Page 295 and 296:
276 Chap. 7 Internal Sortingcan sto
Page 298 and 299:
8File Processing and ExternalSortin
Page 300 and 301:
Sec. 8.1 Primary versus Secondary S
Page 302 and 303:
Sec. 8.2 Disk Drives 283of the data
Page 304 and 305:
Sec. 8.2 Disk Drives 285the informa
Page 306 and 307:
Sec. 8.2 Disk Drives 287Intersector
Page 308 and 309:
Sec. 8.3 Buffers and Buffer Pools 2
Page 310 and 311:
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Sec. 8.4 The Programmer’s View of
Page 318 and 319:
Sec. 8.5 External Sorting 299block
Page 320 and 321:
Sec. 8.5 External Sorting 3018.5.1
Page 322 and 323:
Sec. 8.5 External Sorting 303quenti
Page 324 and 325:
Sec. 8.5 External Sorting 305InputF
Page 326 and 327:
Sec. 8.5 External Sorting 307Fallin
Page 328 and 329:
Sec. 8.5 External Sorting 309replac
Page 330 and 331:
Sec. 8.7 Exercises 311A great discu
Page 332 and 333:
Sec. 8.7 Exercises 313(a) The file
Page 334 and 335:
Sec. 8.8 Projects 315processing is
Page 336 and 337:
9SearchingOrganizing and retrieving
Page 338 and 339:
Sec. 9.1 Searching Unsorted and Sor
Page 340 and 341:
Page 342 and 343:
Page 344 and 345:
Sec. 9.2 Self-Organizing Lists 325A
Page 346 and 347:
Sec. 9.2 Self-Organizing Lists 327n
Page 348 and 349:
Sec. 9.3 Bit Vectors for Representi
Page 350 and 351:
Sec. 9.4 Hashing 331are many approa
Page 352 and 353:
Sec. 9.4 Hashing 3331. Natural dist
Page 354 and 355:
Sec. 9.4 Hashing 335For example, be
Page 356 and 357:
Sec. 9.4 Hashing 337010009530123301
Page 358 and 359:
Sec. 9.4 Hashing 339the desired key
Page 360 and 361:
Sec. 9.4 Hashing 341number of recor
Page 362 and 363:
Sec. 9.4 Hashing 343sequence that c
Page 364 and 365:
Sec. 9.4 Hashing 345found. Alternat
Page 366 and 367:
Sec. 9.4 Hashing 347/** Dictionary
Page 368 and 369:
Sec. 9.4 Hashing 34954InsertDelete3
Page 370 and 371:
Sec. 9.5 Further Reading 351occupie
Page 372 and 373:
Sec. 9.6 Exercises 353list ordered
Page 374 and 375:
Sec. 9.7 Projects 355Be sure to ind
Page 376 and 377:
10IndexingMany large-scale computin
Page 378 and 379:
Sec. 10.1 Linear Indexing 359Linear
Page 380 and 381:
Sec. 10.2 ISAM 361whose records hav
Page 382 and 383:
Sec. 10.2 ISAM 363In-memoryTable of
Page 384 and 385:
Sec. 10.3 Tree-based Indexing 365is
Page 386 and 387:
Sec. 10.4 2-3 Trees 36718331223 30
Page 388 and 389:
Sec. 10.4 2-3 Trees 36918331223 304
Page 390 and 391:
Sec. 10.4 2-3 Trees 371183323202330
Page 392 and 393:
Sec. 10.5 B-Trees 373/** Add a new
Page 394 and 395:
Sec. 10.5 B-Trees 375examining the
Page 396 and 397:
Sec. 10.5 B-Trees 3773318234810 12
Page 398 and 399:
Sec. 10.5 B-Trees 3793318 23 481012
Page 400 and 401:
Sec. 10.5 B-Trees 381required (beca
Page 402 and 403:
Sec. 10.7 Exercises 383(a) Assume t
Page 404:
Sec. 10.8 Projects 38510.8 Projects
Page 408 and 409:
11GraphsGraphs provide the ultimate
Page 410 and 411:
Sec. 11.1 Terminology and Represent
Page 412 and 413:
Sec. 11.1 Terminology and Represent
Page 414 and 415:
Sec. 11.2 Graph Implementations 395
Page 416 and 417:
Sec. 11.2 Graph Implementations 397
Page 418 and 419:
Sec. 11.3 Graph Traversals 399// Ad
Page 420 and 421:
Sec. 11.3 Graph Traversals 401speci
Page 422 and 423:
Sec. 11.3 Graph Traversals 403ACall
Page 424 and 425:
Sec. 11.3 Graph Traversals 405ABABC
Page 426 and 427:
Sec. 11.4 Shortest-Paths Problems 4
Page 428 and 429:
Sec. 11.4 Shortest-Paths Problems 4
Page 430 and 431:
Sec. 11.5 Minimum-Cost Spanning Tre
Page 432 and 433:
Page 434 and 435:
Page 436 and 437:
Sec. 11.6 Further Reading 417Exampl
Page 438 and 439:
Sec. 11.7 Exercises 419class Kruska
Page 440 and 441:
Sec. 11.8 Projects 421MST, show the
Page 442 and 443:
12Lists and Arrays RevisitedSimple
Page 444 and 445:
Sec. 12.1 Multilists 425L1L2L3bcdL4
Page 446 and 447:
Sec. 12.2 Matrix Representations 42
Page 448 and 449:
Sec. 12.2 Matrix Representations 42
Page 450 and 451:
Sec. 12.3 Memory Management 431/**
Page 452 and 453:
Sec. 12.3 Memory Management 433that
Page 454 and 455:
Sec. 12.3 Memory Management 435P−
Page 456 and 457:
Sec. 12.3 Memory Management 437assu
Page 458 and 459:
Sec. 12.3 Memory Management 439Hand
Page 460 and 461:
Sec. 12.3 Memory Management 441and
Page 462 and 463:
Sec. 12.4 Further Reading 4431a3b42
Page 464 and 465:
Sec. 12.6 Projects 44512.9 Write me
Page 466 and 467:
13Advanced Tree StructuresThis chap
Page 468 and 469:
Sec. 13.1 Tries 4490012 70102403201
Page 470 and 471:
Sec. 13.1 Tries 451000xxxx00xxxxx0x
Page 472 and 473:
Sec. 13.2 Balanced Trees 453If we a
Page 474 and 475:
Sec. 13.2 Balanced Trees 455SXDYAYX
Page 476 and 477:
Sec. 13.2 Balanced Trees 457PSSCAPA
Page 478 and 479:
Sec. 13.3 Spatial Data Structures 4
Page 480 and 481:
Page 482 and 483:
Page 484 and 485:
Page 486 and 487:
Page 488 and 489:
Page 490 and 491:
Page 492 and 493:
Sec. 13.4 Further Reading 473Spatia
Page 494 and 495:
Sec. 13.6 Projects 47513.15 (a) Sho
Page 496:
Sec. 13.6 Projects 47713.11 Impleme
Page 500 and 501:
14Analysis TechniquesThis book cont
Page 502 and 503:
Sec. 14.1 Summation Techniques 483c
Page 504 and 505:
Sec. 14.1 Summation Techniques 485O
Page 506 and 507:
Sec. 14.2 Recurrence Relations 487n
Page 508 and 509:
Sec. 14.2 Recurrence Relations 489t
Page 510 and 511:
Sec. 14.2 Recurrence Relations 491u
Page 512 and 513:
Sec. 14.2 Recurrence Relations 493W
Page 514 and 515:
Sec. 14.2 Recurrence Relations 495T
Page 516 and 517:
Sec. 14.3 Amortized Analysis 49714.
Page 518 and 519:
Sec. 14.3 Amortized Analysis 499A s
Page 520 and 521:
Sec. 14.5 Exercises 50114.4 Use sub
Page 522 and 523:
Sec. 14.5 Exercises 50314.21 One ap
Page 524:
Sec. 14.6 Projects 50514.6 Projects
Page 527 and 528:
508 Chap. 15 Lower Boundsbounds on
Page 529 and 530:
510 Chap. 15 Lower Boundsobserve th
Page 531 and 532:
512 Chap. 15 Lower BoundsABCGDEFFig
Page 533 and 534:
514 Chap. 15 Lower Boundsbetter tha
Page 535 and 536:
516 Chap. 15 Lower Boundsfor a tota
Page 537 and 538:
518 Chap. 15 Lower BoundsIn the Han
Page 539 and 540:
520 Chap. 15 Lower BoundsFor exampl
Page 541 and 542:
522 Chap. 15 Lower Bounds... i-1...
Page 543 and 544:
524 Chap. 15 Lower BoundsT(n) ≤ T
Page 545 and 546:
526 Chap. 15 Lower BoundsABAorAFigu
Page 547 and 548:
528 Chap. 15 Lower Bounds15.2 Singl
Page 549 and 550:
530 Chap. 15 Lower Bounds15.18 Writ
Page 551 and 552:
532 Chap. 16 Patterns of Algorithms
Page 553 and 554:
Page 555 and 556:
Page 557 and 558:
Page 559 and 560:
Page 561 and 562:
Page 563 and 564:
Page 565 and 566:
Page 567 and 568:
Page 569 and 570:
Page 571 and 572:
Page 573 and 574:
Page 575 and 576:
Page 578 and 579:
17Limits to ComputationThis book de
Page 580 and 581:
Sec. 17.1 Reductions 56123421793881
Page 582 and 583:
Sec. 17.1 Reductions 563the records
Page 584 and 585:
Sec. 17.1 Reductions 565SORTING:Int
Page 586 and 587:
Sec. 17.2 Hard Problems 567The Towe
Page 588 and 589:
Sec. 17.2 Hard Problems 5693EA8224B
Page 590 and 591:
Sec. 17.2 Hard Problems 571There is
Page 592 and 593:
Sec. 17.2 Hard Problems 573SATISFIA
Page 594 and 595:
Sec. 17.2 Hard Problems 575For the
Page 596 and 597:
Sec. 17.2 Hard Problems 577x 1x 2x
Page 598 and 599:
Sec. 17.2 Hard Problems 579tree. In
Page 600 and 601:
Sec. 17.3 Impossible Problems 58117
Page 602 and 603:
Sec. 17.3 Impossible Problems 583ar
Page 604 and 605:
Sec. 17.3 Impossible Problems 5851
Page 606 and 607:
Sec. 17.3 Impossible Problems 587an
Page 608 and 609:
Sec. 17.5 Exercises 58917.3 Use a r
Page 610 and 611:
Sec. 17.6 Projects 59117.14 The las
Page 612 and 613:
Bibliography[AG06] Ken Arnold and J
Page 614 and 615:
BIBLIOGRAPHY 595[GI91] Zvi Galil an
Page 616 and 617:
BIBLIOGRAPHY 597[Ski98] Steven S. S
Page 618 and 619:
IndexJava, xiv-xvii, 19-21generic,
Page 620 and 621:
INDEX 601composite, see design patt
Page 622 and 623:
INDEX 603constant, 60, 69exponentia
Page 624 and 625:
INDEX 605logical representation, se
Page 626 and 627:
INDEX 607199, 200, 203, 247, 249, 2
Page 628:
INDEX 609units of measure, 29, 49UN
show all

A Practical Introduction to Data Structures and Algorithm Analysis

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?