next up previous
Next: Example: Insertion Sort Up: CSE 2320: Algorithms and Previous: Analyzing Algorithms

Operations

*
Examples: additions, multiplications, comparisons
*
Constant time Ci per ith line of pseudocode
*
In reality each operations takes different amount of time

*
constraints on the input, other than size, resulting in the fastest possible running time

*
constraints on the input, other than size, resulting in the slowest possible running time

*
average running time over every possible type of input (usually involves probabilities of different types of input)



Copyright © 1998 The University of Texas at Arlington