Algorithm design and analysis basics (version 3rd)

Original Title: Introduction to the design and analysis of algorithms, Third Edition Author: (US) anany Levitin Press: tsinghua University Press ISBN: 9787302311850 Release Date: May 2013 publication date: 16 open pages: 596 versions: 3-1 category: computer> Computer science theory and basic knowledge> computing theory> more about algorithms "" basics of algorithm design and analysis (Copyright 3rd) "Content Overview" computer book "basic algorithm design and analysis (version 3rd)" introduces the algorithm design technology with a new classification method, which is further analyzed when discussing analysis methods, formed a coherent, orderly, and refreshing style. This book covers all the content of the algorithm getting started course and focuses more on concepts (rather than forms. The book uses some popular puzzles to stimulate students' interest and help them strengthen and improve their ability to solve algorithm problems. Each chapter includes summary, exercise tips, and detailed answers, forming a distinctive teaching feature. Algorithm design and analysis basics (version 3rd) features: a more comprehensive algorithm design technology classification method covers the mathematical analysis of recursive and non-recursive algorithms, it also involves empirical analysis and algorithm visualization to explore the limitations of algorithms and solutions. The algorithm is considered as a tool for solving problems, using puzzles and games to develop algorithm thinking provides students with more than 600 exercises (including Tips), and provides instructors with detailed answers to the instructor's Manual. The "algorithm design and analysis basics" (version 3rd) new to the third edition xviipreface xix1introduction 11.1 what is an algorithm? 3 release 1.1 71.2 release of release Problem Solving 9 understanding the problem 9 ascertaining the capabilities of the computational device 9 choosing between exact and approximate problem solving 11 release Design Release 11 design an release and data structures 12 methods of specifying an algorithm 12 proving an algorithm's correctness 13 analyzing an algorithm 14 coding an algorithm 15 exercises 1.2 171.3 important problem types 18 sorting 19 searching 20. string processing 20 graph problems 21 Combinatorial Problems 21 Geometric Problems 22 numerical problems 22 exercises 1.3 231.4 fundamental data structures 25 linear data structures 25 graphs 28 trees 31 sets and dictionaries 35 limit 1.4 37 summary 382 limit of the analysis of algorithm efficiency 412.1 the analysis framework 42 measuring an input's size 43 units for measuring running time 44 orders of growth 45worst-case, best-case, and average-case when 47 recapitulation of the analysis framework 50 exercises 2.1 502.2 annotations notations and basic efficiency classes 52 informal introduction 52o-notation 53-notation 54-notation 55 useful property involving the specified notations 55 using limits for comparing orders of growth 56 basic efficiency classes 58 exercises 2.2 582.3 Mathematical Analysis of nonrecursive algorithms 61 blocks 2.3 672.4 Mathematical Analysis of recursive algorithms 70 exercises 2.4 762.5 example: computing the nth Protocol Number 80 exercises 2.5 832.6 Empirical Analysis of algorithms 84 exercises 2.6 892.7 explain visualization 91 summary 943 brute force and exhaustive search 973.1 selection sort and bubble sort 98 selection sort 98 bubble sort exercises 3.1 1023.2 sequential search and brute-force string matching 104 sequential search fetch string matching 105 exercises 3.2 1063.3 closest-pair and convex-hull problems by brute force limit problem 109 exercises 3.3 1133.4 exhaustive search 115 Traveling Salesman Problem 116 export problem 116 assignment problem 119 exercises 3.4 1203.5 depth-first search and breadth-first search elastic search 125 exercises 3.5 128 summary 1304 decrease-and-conquer 1314.1 insertion sort 134 versions 4.1 topological sorting 1364.2 exercises 138 4.2 algorithms for generating custom objects 1424.3 generating permutations 144 Generating Subsets 144 exercises 146 4.3 decrease-by-a-Constant-factor algorithms 1484.4 search fetch problem 152 Russian peasant multiplication 153 Joseph PHUs problem 154 bytes 4.4 variable-size-decrease algorithms 1564.5 computing a median and the selection problem 157 Interpolation Search 158 searching and insertion in a binary search tree 163the game of Nim 164 exercises 4.5 166 summary 1675 divide-and-conquer 1695.1 mergesort 172 exercises 5.1 1745.2 quicksort 176 minutes 5.2 Binary Tree traversals and Related Properties 1815.3 exercises 182 5.3 multiplication of larintegers andstrassen's matrix multiplication 186 multiplication of large integers comment's matrix multiplication 189 seconds 5.4 1915.5 the closest-pair and convex-hull divide-and-conquer 192the closest-pair problem limit problem 195 bytes 5.5 197 summary 1986 transform-and-conquer 2016.1 presorting 202 exercises 6.1 2056.2 Gaussian elimination 208lu decomposition 212 computing a matrix inverse 214 computing a determinant 215 limit 6.2 2166.3 balanced search trees limit 2182 -3 trees 223 exercises 6.3 2256.4 heaps and limit 226 notion of the heap 227 heapsort 231 exercises 6.4 2336.5 Horner's rule and binary exponentiation 234horner's rule 234 binary exponentiation 236 exercises 6.5 2396.6 Problem ction 240 computing the least common multiple 241 counting paths in a graph 242 ction of Optimization Problems 243 Linear Programming 244 ction to graph problems 246 exercises 6.6 248 summary 2507 space and time trade-offs 2537.1 sorting by counting 254 exercises 7.1 2577.2 input enhancement in string matching 258horspool's algorithm 259boyer-moore algorithm 263 exercises 7.2 2677.3 hashing 269 open hashing (separate chaining) 270 closed hashing (Open addressing) 272 exercises 7.3 2747.4 B-trees 276 exercises 7.4 279 summary 2808 Dynamic Programming 2838.1 three basic examples 285 exercises 8.1 2908.2 the specified problem and memory functions 292 memory functions 294 exercises 8.2 2968.3 optimal binary search trees 297 exercises 8.3 3038.4 warshall's and Floyd's algorithms 304warshall's algorithm 304floyd's algorithm for the all-pairs shortest-paths problem 308 exercises 8.4 311 summary 312