Computer Science A - Insertion Sort - 10/14/99

20     15      18     30       6
[0]

1       2       3       4
15      15      15      6
20      18      18      15
18      20      20      18
30      30      30      20
6       6       6       30
c = 1   c = 2   c = 1   c = 4
s = 1   s = 1   s = 0   s = 4

passes = N - 1

comparisons = N(N - 1)/2

time = 0(Nē)