pbDRAFTbppIntroduction to Algorithm DesignppAlgorithm AnalysisbrppData StructuresbrppSorting and SearchingbrppDivide and ConquerbrppRandomized Algorithms and HashingbrppGraph TraversalbrpWeighted Graph AlgorithmsbrpppCombinatorial Search and Heuristic MethodsbrppDynamic ProgrammingbrppNP-CompletenessbrppDealing with Hard Problems brppHow to Design Algorithmspp14 A Catalog of Algorithmic Problems 437pp15 Data Structures 439pp15.1 Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 440pp15.2 Priority Queues . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445pp15.3 Sux Trees and Arrays . . . . . . . . . . . . . . . . . . . . . . . 448pp15.4 Graph Data Structures . . . . . . . . . . . . . . . . . . . . . . . . 452pp15.5 Set Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . 456pp15.6 Kd-Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 460pp16 Numerical Problems 465pp16.1 Solving Linear Equations . . . . . . . . . . . . . . . .