next up previous
Next: For larger input size: Up: CSE 2320: Algorithms and Previous: Example: Merge Sort

Analyzing Divide-and-Conquer Algorithms

Definition: A or describes the running time of a recursive algorithm on a problem of size n in terms of the running time of the algorithm on smaller inputs.



For small enough input size (n $\leq$ c, for example), running time is constant.



Copyright © 1998 The University of Texas at Arlington