In a nutshell

Sebastopol : : O'Reilly Media, , 2008.

1 online resource (364 p.)

Description based upon print version of record.. - Table of Contents; Preface; Principle: Use Real Code, Not Pseudocode; Principle: Separate the Algorithm from the Problem Being Solved; Principle: Introduce Just Enough Mathematics; Principle: Support Mathematical Analysis Empirically; Audience; Contents of This Book; Conventions Used in This Book; Using Code Examples; Comments and Questions; Safari® Books Online; Acknowledgments; References; I; Algorithms Matter; Understand the Problem; Experiment if Necessary; Algorithms to the Rescue; Side Story; The Moral of the Story; References; The Mathematics of Algorithms; Size of a Problem Instance. - ForcesSolution; Consequences; Analysis; Variations; Hash-based Search; Input/Output; Assumptions; Context; Forces; Solution; Consequences; Analysis; Variations; Binary Tree Search; Input/Output; Context; Forces; Solution; Consequences; Analysis; Variations; References; Graph Algorithms; Overview; Graphs; Storage Issues; Graph Analysis; Data Structure Design; Problems; Depth-First Search; Input/Output; Input; Output; Assumptions; Context; Solution; Analysis; Breadth-First Search; Input/Output; Input; Output; Assumptions; Context; Solution; Analysis; Single-Source Shortest Path; Input/Output. - Input. - Picking a pivotProcessing the partition; Processing subarrays; Using simpler insertion technique for small subarrays; IntroSort; Selection Sort; Heap Sort; Context; Forces; Solution; Analysis; Variations; Counting Sort; Context; Forces; Solution; Analysis; Bucket Sort; Context; Forces; Solution; Analysis; Variations; Criteria for Choosing a Sorting Algorithm; String Benchmark Results; Double Benchmark Results; References; Searching; Overview; Sequential Search; Input/Output; Input; Output; Context; Forces; Solution; Consequences; Analysis; Variations; Binary Search; Input/Output; Context. - Pseudocode Pattern FormatDesign Format; Empirical Evaluation Format; Domains and Algorithms; Floating-Point Computations; Rounding Error; Comparing Values; Special Quantities; Performance; Manual Memory Allocation; Choosing a Programming Language; References; II; Sorting Algorithms; Overview; Terminology; Representation; Comparable Elements; Stable Sorting; Analysis Techniques; Common Input; Insertion Sort; Context; Forces; Solution; Consequences; Analysis; Median Sort; Context; Forces; Solution; Consequences; Analysis; Quicksort; Context; Solution; Consequences; Analysis; Variations. - Rate of Growth of FunctionsAnalysis in the Best, Average, and Worst Cases; Worst-Case; Average-Case; Best-Case; Performance Families; Discussion 0: Constant Behavior; Discussion 1: Log n Behavior; Discussion 2: Sublinear O(nd) Behavior for d<1; Discussion 3: Linear Performance; Discussion 4: n log n Performance; Discussion 5a: Quadratic Performance; Discussion 5b: Less Obvious Performance Computations; Mix of Operations; Benchmark Operations; One Final Point; References; Patterns and Domains; Patterns: A Communication Language; The Form of an Algorithm Pattern; Algorithm Pattern Format. - Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs -- with just enough math to let you understand and analyze algorithm performance. With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each

Electronic books.

005.1

9780596516246