Whenever we describe an algorithm, our description should include every detail necessary to fully specify the algorithm, prove its correctness, and analyze its running time.

We keep the material in algorithmic con- text, describing data structures, algorithm design paradigms, reduction, and problem-solving models. We cover classic methods that have been taught since the …

In the logician's voice: an algorithm is nite procedure, written in a xed symbolic vocabulary governed by precise instructions, moving in discrete steps, 1, 2, 3, ... whose execution requires no insight, …

lgorithm is called the run time. The run time for a computer program can be afected by many diferent things, such as the size of the data your algorithm is working with and the ove all eficiency of your …

We then discuss the MergeSort algorithm in detail, for several reasons: it’s a practical and famous algorithm that you should know; it’s a good warm-up to get you ready for more intricate algorithms; …

• Pseudo-code is a description of an algorithm that is more structured than usual prose but less formal than a programming language. • Example: finding the maximum element of an array.

Algorithm C solves problems of size n by dividing them into nine subproblems of size n=3, recursively solving each subproblem, and then combining the solutions in O(n2) time.