## Fundamentals of Algorithmics |

### Common terms and phrases

algorithm takes analysis answer approximate algorithm arbitrary array assume asymptotic notation Boolean bound 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 error probability eventually nondecreasing example executed exists Figure function given gives graph G greedy algorithm heap implementation initial inputs insertion sorting knapsack problem large integers Las Vegas algorithm least linear mathematical induction matrix merge mergesort Monte Carlo algorithm multiplication nondeterministic algorithm NP-complete O(n² objects obtained operands operations optimal solution parallel algorithm pointer polynomial positive integer possible prime numbers probabilistic algorithms processors proof prove quadratic queens quicksort random recursive calls rithm root round the loop Section sequence subinstances sufficiently large Suppose technique Theorem tion undirected graph Vegas algorithm worst