Fundamentals of AlgorithmicsThis is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application. |
Contents
PRELIMINARIES | 1 |
ELEMENTARY ALGORITHMICS | 57 |
ASYMPTOTIC NOTATION | 79 |
Copyright | |
12 other sections not shown
Common terms and phrases
algorithm takes analysis answer approximate algorithm arbitrary array assume asymptotic notation binary tree binomial binomial heap Boolean bound c₁ calculate choose coins colour compute Consider constant corresponding cost dæmon decision problem defined denote depth-first search deterministic dynamic programming edges efficient algorithm elements Equation eventually nondecreasing example executed exists Fibonacci Figure function given gives greedy algorithm Hamiltonian heap heapsort implementation initial inputs insertion sorting instance knapsack problem large integers Las Vegas algorithm least linear mathematical induction matrix merge mergesort Monte Carlo algorithm multiplication NP-complete O(n² objects obtained operands operations optimal solution path pointer polynomial positive integer possible prime numbers probabilistic algorithms processors proof prove quadratic quicksort random recurrence recursive calls root round the loop Section sequence solve subinstances sufficiently large Suppose technique Theorem tion undirected graph Vegas algorithm worst