Lecture 1:a. Correctnes b. Applets c. Tables Lecture 2 a.Applets b.Tables c.Exercises Lecture 3Lecture 4a.Appletsb. ProblemsLecture 5 Lecture 6 Lecture 7 Lecture 8 Test 1 Test 2 |
Formula
Procedure_insertSort(A[ 1…n ]) |
|
for i = 2 to n do |
C1 |
n |
|
x = A[ i ] |
C2 |
n-1 |
|
j = i – 1 |
C3 |
n-1 |
|
while x <= A[ j ] and j > 0 do |
C4 |
|
|
A[ j+1 ] = A[ j ] |
C5 |
|
j = j – 1 |
C6 |
|
|
end_while |
|
- |
|
A[ j+1 ] = x |
C7 |
n-1 |
|
end_for |
|
- |
end |
|
- |
|
