Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures. The book begins with a discussion on the fundamentals of data structures and algorithms, and moves on to the concepts of linear data structures, stacks, recursion, queues, and searching and sorting. All the elements of data structures, such as linked lists, trees, graphs, hashing, heaps, and indexing, are covered in separate chapters in detail. The chapter on files explains file management and organization using C++ and the chapter on the standard template library provides detailed coverage of entities such as containers and iterators. A chapter on algorithm analysis and design is provided towards the end that discusses the various algorithmic strategies required to solve a problem effectively and efficiently. Written in a simple manner with strong pedagogy including numerous multiple choice and review questions, the book also provides programming problems at the end of every chapter.

Table of Contents:
1 FUNDAMENTAL CONCEPTS 1 ; 1.1 INTRODUCTION TO PROGRAMMING 1 ; 1.2 OBJECT-ORIENTED PROGRAMMING 3 ; 1.3 INTRODUCTION TO DATA STRUCTURES 3 ; 1.3.1 DATA 4 ; 1.3.2 DATA TYPE 4 ; 1.3.3 DATA OBJECT 5 ; 1.3.4 DATA STRUCTURE 5 ; 1.3.5 ABSTRACT DATA TYPE 6 ; 1.4 TYPES OF DATA STRUCTURES 9 ; 1.4.1 PRIMITIVE AND NON-PRIMITIVE DATA STRUCTURES 9 ; 1.4.2 LINEAR AND NON-LINEAR DATA STRUCTURES 9 ; 1.4.3 STATIC AND DYNAMIC DATA STRUCTURES 10 ; 1.4.4 PERSISTENT AND EPHEMERAL DATA STRUCTURES 10 ; 1.4.5 SEQUENTIAL ACCESS AND DIRECT ACCESS DATA STRUCTURES 11 ; 1.5 INTRODUCTION TO ALGORITHMS 11 ; 1.5.1 CHARACTERISTICS OF ALGORITHMS 12 ; 1.5.2 ALGORITHMICS 13 ; 1.5.3 ALGORITHM DESIGN TOOLS: PSEUDOCODE AND FL OWCHART 13 ; 1.6 PSEUDOCODE 14 ; 1.6.1 PSEUDOCODE NOTATIONS 14 ; 1.6.2 ALGORITHM HEADER 14 ; 1.6.3 PURPOSE 15 ; 1.6.4 CONDITION AND RETURN STATEMENTS 15 ; 1.6.5 STATEMENT NUMBERS 16 ; 1.6.6 VARIABLES 16 ; 1.6.7 STATEMENT CONSTRUCTS 17 ; 1.6.8 SUBALGORITHMS 18 ; 1.7 RELATIONSHIP AMONG DATA, DATA STRUCTURES, AND ALGORITHMS 20 ; 1.8 IMPLEMENTATION OF DATA STRUCTURES 21 ; 1.9 FLOWCHARTS 22 ; 1.10 ANALYSIS OF ALGORITHMS 22 ; 1.10.1 COMPLEXITY OF ALGORITHMS 22 ; 1.10.2 SPACE COMPLEXITY 23 ; 1.10.3 TIME COMPLEXITY 24 ; 1.10.4 COMPUTING TIME COMPLEXITY OF AN ALGORITHM 24 ; 1.10.5 BIG-O NOTATION 25 ; 1.11 FROM PROBLEM TO PROGRAM 26 ; 1.12 SOFTWARE ENGINEERING 27 ; 1.12.1 ANALYSIS PHASE 27 ; 1.12.2 DESIGN PHASE 28 ; 1.12.3 IMPLEMENTATION PHASE 28 ; 1.12.4 TESTING PHASE 29 ; 1.12.5 VERIFI CATION 29 ; 2 LINEAR DATA STRUCTURE USING ARRAYS 34 ; 2.1 SEQUENTIAL ORGANIZATION 34 ; 2.2 LINEAR DATA STRUCTURE USING SEQUENTIAL ORGANIZATION: ARRAYS 35 ; 2.3 ARRAY AS AN ABSTRACT DATA TYPE 37 ; 2.4 MEMORY REPRESENTATION AND ADDRESS CALCULATION 39 ; 2.5 THE CLASS ARRAY 41 ; 2.5.1 INSERTING AN ELEMENT INTO AN ARRAY 43 ; 2.5.2 DELETING AN ELEMENT 45 ; 2.6 ARRAYS USING TEMPLATE 47 ; 2.7 MULTIDIMENSIONAL ARRAYS 48 ; 2.7.1 TWO-DIMENSIONAL ARRAYS 48 ; 2.7.2 N-DIMENSIONAL ARRAYS 53 ; 2.8 CONCEPT OF ORDERED LIST 58 ; 2.9 SINGLE VARIABLE POLYNOMIAL 59 ; 2.9.1 REPRESENTATION USING ARRAYS 59 ; 2.9.2 POLYNOMIAL AS ARRAY OF STRUCTURE 61 ; 2.9.3 POLYNOMIAL EVALUATION 62 ; 2.9.4 POLYNOMIAL ADDITION 63 ; 2.9.5 POLYNOMIAL MULTIPLICATION 67 ; 2.10 ARRAY FOR FREQUENCY COUNT 70 ; 2.11 SPARSE MATRIX 71 ; 2.11.1 SPARSE MATRIX REPRESENTATION 73 ; 2.11.2 SPARSE MATRIX ADDITION 74 ; 2.11.3 TRANSPOSE OF SPARSE MATRIX 78 ; 2.12 STRING MANIPULATION USING ARRAY 85 ; 2.13 PROS AND CONS OF ARRAYS 90 ; 2.13.1 CHARACTERISTICS 90 ; 2.13.2 ADVANTAGES 90 ; 2.13.3 DISADVANTAGES 91 ; 2.13.4 APPLICATIONS OF ARRAYS 91 ; 3 STACKS 96 ; 3.1 CONCEPT OF STACKS AND QUEUES 96 ; 3.2 STACKS 97 ; 3.2.1 PRIMITIVE OPERATIONS 98 ; 3.3 STACK ABSTRACT DATA TYPE 101 ; 3.4 REPRESENTATION OF STACKS USING SEQUENTIAL ORGANIZATION (ARRAYS) 102 ; 3.4.1 CREATE 104 ; 3.4.2 EMPTY 104 ; 3.4.3 GETTOP 104 ; 3.4.4 PUSH 105 ; 3.4.5 POP 105 ; 3.5 STACKS USING TEMPLATE 107 ; 3.6 MULTIPLE STACKS 109 ; 3.7 APPLICATIONS OF STACK 112 ; 3.8 EXPRESSION EVALUATION AND CONVERSION 112 ; 3.8.1 POLISH NOTATION AND EXPRESSION CONVERSION 114 ; 3.8.2 NEED FOR PREFI X AND POSTFI X EXPRESSIONS 115 ; 3.8.3 POSTFI X EXPRESSION EVALUATION 115 ; 3.9 PROCESSING OF FUNCTION CALLS 139 ; 3.10 REVERSING A STRING WITH A STACK 141 ; 3.11 CHECKING CORRECTNESS OF WELL-FORMED PARENTHESES 142 ; 3.12 RECURSION 143 ; 3.13 PARSING COMPUTER PROGRAMS 144 ; 3.14 BACKTRACKING ALGORITHMS 144 ; 3.15 CONVERTING DECIMAL NUMBERS TO BINARY 144 ; 4 RECURSION 151 ; 4.1 INTRODUCTION 151 ; 4.2 RECURRENCE 154 ; 4.3 USE OF STACK IN RECURSION 155 ; 4.4 VARIANTS OF RECURSION 156 ; 4.4.1 DIRECT RECURSION 157 ; 4.4.2 INDIRECT RECURSION 157 ; 4.4.3 TAIL RECURSION 158 ; 4.4.4 LINEAR RECURSION 159 ; 4.4.5 TREE RECURSION 159 ; 4.5 EXECUTION OF RECURSIVE CALLS 160 ; 4.6 RECURSIVE FUNCTIONS 161 ; 4.6.1 WRITING RECURSIVE CODE 163 ; 4.6.2 TOWER OF HANOI: AN EXAMPLE OF RECURSION 163 ; 4.6.3 CHECKING FOR CORRECTNESS 165 ; 4.6.4 THINGS TO REMEMBER 166 ; 4.7 ITERATION VERSUS RECURSION 166 ; 4.7.1 DEMERITS OF RECURSIVE ALGORITHMS 166 ; 4.7.2 DEMERITS OF ITERATIVE METHODS 167 ; 4.8 SIMULATING RECURSION USING STACK (ELIMINATING RECURSION) 167 ; 4.9 APPLICATIONS OF RECURSION 168 ; 5 QUEUES 174 ; 5.1 CONCEPT OF QUEUES 174 ; 5.2 QUEUE AS ABSTRACT DATA TYPE 175 ; 5.3 REALIZATION OF QUEUES USING ARRAYS 176 ; 5.4 CIRCULAR QUEUE 182 ; 5.4.1 ADVANTAGES OF USING CIRCULAR QUEUES 186 ; 5.5 MULTI-QUEUES 186 ; 5.6 DEQUE 187 ; 5.7 PRIORITY QUEUE 188 ; 5.7.1 ARRAY IMPLEMENTATION OF PRIORITY QUEUE 191 ; 5.8 APPLICATIONS OF QUEUES 191 ; 5.8.1 JOSEPHUS PROBLEM 192 ; 5.8.2 JOB SCHEDULING 193 ; 5.8.3 SIMULATION 194 ; 5.9 QUEUES USING TEMPLATES 195 ; 6 LINKED LISTS 202 ; 6.1 INTRODUCTION 202 ; 6.2 LINKED LIST 203 ; 6.2.1 COMPARISON OF SEQUENTIAL AND LINKED ORGANIZATIONS 206 ; 6.2.2 LINKED LIST TERMINOLOGY 207 ; 6.2.3 PRIMITIVE OPERATIONS 208 ; 6.3 REALIZATION OF LINKED LISTS 208 ; 6.3.1 REALIZATION OF LINKED LIST USING ARRAYS 209 ; 6.3.2 LINKED LIST USING DYNAMIC MEMORY MANAGEMENT 210 ; 6.4 DYNAMIC MEMORY MANAGEMENT 211 ; 6.4.1 DYNAMIC MEMORY MANAGEMENT IN C++ WITH NEW AND ; DELETE OPERATORS 212 ; 6.5 LINKED LIST ABSTRACT DATA TYPE 214 ; 6.5.1 DATA STRUCTURE OF NODE 216 ; 6.5.2 INSERTION OF A NODE 219 ; 6.5.3 LINKED LIST TRAVERSAL 225 ; 6.5.4 DELETION OF A NODE 228 ; 6.6 LINKED LIST VARIANTS 231 ; 6.6.1 HEAD POINTER AND HEADER NODE 231 ; 6.6.2 TYPES OF LINKED LIST 232 ; 6.6.3 LINEAR AND CIRCULAR LINKED LISTS 233 ; 6.7 DOUBLY LINKED LIST 234 ; 6.7.1 CREATION OF DOUBLY LINKED LIST 235 ; 6.7.2 DELETION OF A NODE FROM A DOUBLY LINKED LIST 238 ; 6.7.3 INSERTION OF A NODE IN A DOUBLY LINKED LIST 241 ; 6.7.4 TRAVERSAL OF DLL 243 ; 6.8 CIRCULAR LINKED LIST 244 ; 6.8.1 SINGLY CIRCULAR LINKED LIST 245 ; 6.8.2 CIRCULAR LINKED LIST WITH HEADER NODE 246 ; 6.8.3 DOUBLY CIRCULAR LINKED LIST 247 ; 6.9 POLYNOMIAL MANIPULATIONS 248 ; 6.9.1 POLYNOMIAL EVALUATION 250 ; 6.9.2 POLYNOMIAL ADDITION 251 ; 6.9.3 MULTIPLICATION OF TWO POLYNOMIALS 254 ; 6.10 REPRESENTATION OF SPARSE MATRIX USING LINKED LIST 257 ; 6.11 LINKED STACK 259 ; 6.11.1 CLASS FOR LINKED STACK 259 ; 6.11.2 OPERATIONS ON LINKED STACK 261 ; 6.12 LINKED QUEUE 263 ; 6.12.1 ERASING A LINKED QUEUE 267 ; 6.13 GENERALIZED LINKED LIST 267 ; 6.13.1 DEFI NITION 268 ; 6.13.2 APPLICATIONS 269 ; 6.13.3 REPRESENTATION OF POLYNOMIALS USING GENERALIZED LINKED LIST 272 ; 6.13.4 REPRESENTATION OF SETS USING GENERALIZED LINKED LIST 277 ; 6.14 MORE ON LINKED LISTS 279 ; 6.14.1 COPYING A LINKED LIST 279 ; 16.4.2 COMPUTING THE LENGTH OF A LINKED LIST 280 ; 6.14.3 REVERSING SINGLY LINKED LIST WITHOUT TEMPORARY STORAGE 281 ; 6.14.4 CONCATENATING TWO LINKED LISTS 282 ; 6.14.5 ERASING THE LINKED LIST 282 ; 6.15 APPLICATION OF LINKED LIST-GARBAGE COLLECTION 283 ; 7 TREES 289 ; 7.1 INTRODUCTION 289 ; 7.1.1 BASIC TERMINOLOGY 290 ; 7.1.2 GENERAL TREES 295 ; 7.1.3 REPRESENTATION OF A GENERAL TREE 298 ; 7.2 TYPES OF TREES 299 ; 7.3 BINARY TREE 302 ; 7.3.1 PROPERTIES OF A BINARY TREE 303 ; 7.4 BINARY TREE ABSTRACT DATA TYPE 306 ; 7.5 REALIZATION OF A BINARY TREE 308 ; 7.5.1 ARRAY IMPLEMENTATION OF BINARY TREES 308 ; 7.5.2 LINKED IMPLEMENTATION OF BINARY TREES 311 ; 7.6 INSERTION OF A NODE IN BINARY TREE 315 ; 7.7 BINARY TREE TRAVERSAL 316 ; 7.7.1 PREORDER TRAVERSAL 317 ; 7.7.2 INORDER TRAVERSAL 318 ; 7.7.3 POSTORDER TRAVERSAL 319 ; 7.7.4 NON-RECURSIVE IMPLEMENTATION OF TRAVERSALS 320 ; 7.7.5 FORMATION OF BINARY TREE FROM ITS TRAVERSALS 326 ; 7.7.6 BREADTH- AND DEPTH-FI RST TRAVERSALS 330 ; 7.8 OTHER TREE OPERATIONS 333 ; 7.8.1 COUNTING NODES 333 ; 7.8.2 COUNTING LEAF NODES 333 ; 7.8.3 COMPUTING HEIGHT OF BINARY TREE 333 ; 7.8.4 GETTING MIRROR, REPLICA, OR TREE INTERCHANGE OF BINARY TREE 334 ; 7.8.5 COPYING BINARY TREE 334 ; 7.8.6 EQUALITY TEST 334 ; 7.9 CONVERSION OF GENERAL TREE TO BINARY TREE 335 ; 7.10 BINARY SEARCH TREE 339 ; 7.10.1 INSERTING A NODE 341 ; 7.10.2 SEARCHING FOR A KEY 346 ; 7.10.3 DELETING A NODE 348 ; 7.10.4 BINARY TREE AND BINARY SEARCH TREE 354 ; 7.11 THREADED BINARY TREE 355 ; 7.11.1 THREADING A BINARY TREE 358 ; 7.11.2 RIGHT-THREADED BINARY TREE 364 ; 7.11.3 INORDER TRAVERSAL 364 ; 7.11.4 PREORDER TRAVERSAL 366 ; 7.11.5 INSERT TO RIGHT OF A NODE 366 ; 7.11.6 DELETING A NODE 368 ; 7.11.7 PROS AND CONS 368 ; 7.12 APPLICATIONS OF BINARY TREES 369 ; 7.12.1 EXPRESSION TREE 369 ; 7.12.2 DECISION TREE 373 ; 7.12.3 HUFFMAN'S CODING 375 ; 7.12.4 GAME TREES 378 ; 8 GRAPHS 388 ; 8.1 INTRODUCTION 388 ; 8.2 GRAPH ABSTRACT DATA TYPE 389 ; 8.3 REPRESENTATION OF GRAPHS 391 ; 8.3.1 ADJACENCY MATRIX 391 ; 8.3.2 ADJACENCY LIST 394 ; 8.3.3 ADJACENCY MULTILIST 399 ; 8.3.4 INVERSE ADJACENCY LIST 400 ; 8.3.5 COMPARISON OF SEQUENTIAL AND LINKED REPRESENTATIONS 401 ; 8.4 GRAPH TRAVERSAL 401 ; 8.4.1 DEPTH-FI RST SEARCH 401 ; 8.4.2 BREADTH-FI RST SEARCH 408 ; 8.5 SPANNING TREE 412 ; 8.5.1 CONNECTED COMPONENTS 413 ; 8.5.2 PRIM'S ALGORITHM 413 ; 8.5.3 KRUSKAL'S ALGORITHM 418 ; 8.5.4 BICONNECTED COMPONENTS 423 ; 8.5.5 DISJOINT SET OPERATIONS 424 ; 8.6 SHORTEST PATH ALGORITHM 424 ; 9 SEARCHING AND SORTING 438 ; 9.1 SEARCHING 438 ; 9.2 SEARCH TECHNIQUES 439 ; 9.2.1 SEQUENTIAL SEARCH 439 ; 9.2.2 BINARY SEARCH 444 ; 9.2.3 FIBONACCI SEARCH 447 ; 9.2.4 INDEXED SEQUENTIAL SEARCH 450 ; 9.2.5 HASHED SEARCH 454 ; 9.3 SORTING 455 ; 9.3.1 TYPES OF SORTING 455 ; 9.3.2 GENERAL SORT CONCEPTS 457 ; 9.3.3 BUBBLE SORT 458 ; 9.3.4 INSERTION SORT 462 ; 9.3.5 SELECTION SORT 466 ; 9.3.6 QUICK SORT 469 ; 9.3.7 HEAP SORT 474 ; 9.3.8 SHELL SORT 478 ; 9.3.9 BUCKET SORT 479 ; 9.3.10 RADIX SORT 481 ; 9.3.11 FILE SORT 483 ; 9.3.12 MERGE SORT 484 ; 9.4 MULTIWAY MERGE AND POLYPHASE MERGE 487 ; 9.4.1 COMPARISON OF ORDINARY MERGE SORT AND POLYPHASE SORT 487 ; 9.5 COMPARISON OF ALL SORTING METHODS 489 ; 10 SEARCH TREES 498 ; 10.1 SYMBOL TABLE 498 ; 10.1.1 REPRESENTATION OF SYMBOL TABLE 499 ; 10.2 OPTIMAL BINARY SEARCH TREE 500 ; 10.3 AVL TREE (HEIGHT-BALANCED TREE) 519 ; 10.3.1 IMPLEMENTATION OF AVL TECHNIQUE 528 ; 10.3.2 INSERTIONS AND DELETIONS IN AVL TREE 533 ; 11 HASHING 547 ; 11.1 INTRODUCTION 547 ; 11.2 KEY TERMS AND ISSUES 549 ; 11.3 HASH FUNCTIONS 551 ; 11.3.1 GOOD HASH FUNCTION 552 ; 11.3.2 DIVISION METHOD 552 ; 11.3.3 MULTIPLICATION METHOD 552 ; 11.3.4 EXTRACTION METHOD 553 ; 11.3.5 MID-SQUARE HASHING 554 ; 11.3.6 FOLDING TECHNIQUE 554 ; 11.3.7 ROTATION 555 ; 11.3.8 UNIVERSAL HASHING 555 ; 11.4 COLLISION RESOLUTION STRATEGIES 555 ; 11.4.1 OPEN ADDRESSING 556 ; 11.4.2 CHAINING 566 ; 11.5 HASH TABLE OVERFL OW 569 ; 11.5.1 OPEN ADDRESSING FOR OVERFL OW HANDLING 570 ; 11.5.2 OVERFL OW HANDLING BY CHAINING 570 ; 11.6 EXTENDIBLE HASHING 571 ; 11.7 DICTIONARY 573 ; 11.8 SKIP LIST 573 ; 11.9 COMPARISON OF HASHING AND SKIP LISTS 574 ; 12 HEAPS 578 ; 12.1 BASIC CONCEPTS 578 ; 12.1.1 MIN-HEAP AND MAX-HEAP 579 ; 12.2 IMPLEMENTATION OF HEAP 581 ; 12.3 HEAP AS ABSTRACT DATA TYPE 582 ; 12.3.1 OPERATIONS ON HEAPS 583 ; DETAILED CONTENTS IX ; DSUC DETAILED_CONTENTS V2 NOVEMBER 18, 2011 5:59 PM PAGE IX ; 12.4 HEAP APPLICATIONS 594 ; 12.5 HEAP SORT 595 ; 12.6 BINOMIAL TREES AND HEAPS 601 ; 12.6.1 BINOMIAL TREES 601 ; 12.6.2 BINOMIAL HEAP 602 ; 12.6.3 REPRESENTATION OF BINOMIAL HEAP 603 ; 12.6.4 OPERATIONS ON BINOMIAL HEAPS 604 ; 12.7 FIBONACCI HEAP 604 ; 12.7.1 REPRESENTATION OF FIBONACCI HEAP 604 ; 12.7.2 OPERATIONS ON FIBONACCI HEAPS 606 ; 13 INDEXING AND MULTIWAY TREES 612 ; 13.1 INTRODUCTION 612 ; 13.2 INDEXING 613 ; 13.2.1 INDEXING TECHNIQUES 614 ; 13.3 TYPES OF SEARCH TREES 616 ; 13.3.1 MULTIWAY SEARCH TREE 616 ; 13.3.2 B-TREE 617 ; 13.3.3 B+ TREE 647 ; 13.3.4 TRIE TREE 651 ; 13.3.5 SPLAY TREE 653 ; 13.3.6 RED-BLACK TREE 654 ; 13.3.7 K-DIMENSIONAL TREE 656 ; 13.3.8 AA TREE 657 ; 14 FILES 662 ; 14.1 INTRODUCTION 662 ; 14.2 EXTERNAL STORAGE DEVICES 663 ; 14.2.1 MAGNETIC TAPE 664 ; 14.2.2 MAGNETIC DRUM 664 ; 14.2.3 MAGNETIC DISK 664 ; 14.3 FILE ORGANIZATION 665 ; 14.3.1 SCHEMES OF FI LE ORGANIZATION 665 ; 14.3.2 FACTORS AFFECTING FI LE ORGANIZATION 666 ; 14.3.3 FACTORS INVOLVED IN SELECTING FI LE ORGANIZATION 666 ; 14.4 FILES USING C++ 667 ; 14.4.1 FILE I/O CLASSES 667 ; 14.4.2 PRIMITIVE FUNCTIONS 667 ; 14.4.3 BINARY AND TEXT FI LES 672 ; 14.5 SEQUENTIAL FILE ORGANIZATION 675 ; 14.5.1 PRIMITIVE OPERATIONS 676 ; 14.5.2 ADVANTAGES 679 ; 14.5.3 DRAWBACKS 679 ; 14.6 DIRECT ACCESS FILE ORGANIZATION 679 ; 14.6.1 PRIMITIVE OPERATIONS 680 ; 14.7 INDEXED SEQUENTIAL FILE ORGANIZATION 686 ; 14.7.1 TYPES OF INDICES 686 ; 14.7.2 STRUCTURE OF INDEXED SEQUENTIAL FI LE 687 ; 14.7.3 CHARACTERISTICS OF INDEXED SEQUENTIAL FI LE 688 ; 14.8 LINKED ORGANIZATION 693 ; 14.8.1 MULTILIST FI LES 693 ; 14.8.2 CORAL RINGS 695 ; 14.8.3 INVERTED FI LES 695 ; 14.8.4 CELLULAR PARTITIONS 696 ; 15 STANDARD TEMPLATE LIBRARY 703 ; 15.1 ABSTRACT DATA TYPE 703 ; 15.1.1 ABSTRACT DATA TYPE AND DATA STRUCTURES 704 ; 15.1.2 CREATING ABSTRACT DATA TYPES 704 ; 15.1.3 STACK ABSTRACT DATA TYPE 705 ; 15.2 SURVEY OF PROGRAMMING TECHNIQUES 706 ; 15.3 STANDARD TEMPLATE LIBRARY 718 ; 15.3.1 CONTAINERS 718 ; 15.3.2 ALGORITHMS 730 ; 15.3.3 ITERATORS 733 ; 15.3.4 FUNCTION OBJECTS 737 ; 16 ALGORITHM ANALYSIS AND DESIGN 741 ; 16.1 INTRODUCTION 741 ; 16.1.1 ALGORITHM ANALYSIS 742 ; 16.1.2 ASYMPTOTIC NOTATIONS ( , Q, O) 742 ; 16.2 DIVIDE-AND-CONQUER 743 ; 16.2.1 UNIQUE CHARACTERISTICS AND USE 743 ; 16.2.2 GENERAL METHOD 744 ; 16.2.3 BINARY SEARCH 745 ; 16.2.4 MERGE SORT 747 ; 16.2.5 QUICK SORT 750 ; 16.2.6 STRASSEN'S ALGORITHM FOR MATRIX MULTIPLICATION 756 ; 16.3 GREEDY METHOD 758 ; 16.3.1 GENERAL GREEDY METHOD 758 ; 16.3.2 KNAPSACK PROBLEM 759 ; 16.4 DYNAMIC PROGRAMMING 762 ; 16.4.1 THE GENERAL METHOD 762 ; 16.4.2 ELEMENTS OF DYNAMIC PROGRAMMING 763 ; 16.4.3 PRINCIPLE OF OPTIMALITY 764 ; 16.4.4 LIMITATIONS OF DYNAMIC PROGRAMMING 765 ; 16.4.5 KNAPSACK PROBLEM 766 ; 16.5 PATTERN MATCHING 770 ; 16.5.1 BRUTE-FORCE APPROACH 771 ; 16.5.2 BOYER-MOORE ALGORITHM 774 ; 16.5.3 KNUTH-MORRIS-PRATT ALGORITHM 775 ; 16.6 TRIES 781 ; 16.6.1 STANDARD TRIES 782 ; 16.6.2 COMPRESSED TRIES 783 ; 16.6.3 SUFFI X TRIES 783 ; APPENDIX 788 ; INDEX 827