It is a pdf document containing the analysis of algorithm named Selection Sort.

1. 10 14 27 33 35 19 42 44Array : T
.
.
.
.
.
.
.
.
.
3rd Iteration
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
minj = 3
minx = 27
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Inner For Loop
j = 4
.
.
.
j = 5
.
.
.
j = 6
.
.
.
j = 7
.
.
.
j = 8
.
.
.
33 < 27 (F)
.
.
.
35 < 27 (F)
.
.
.
19 < 27 (T)
.
.
.
42 < 19 (F)
.
.
.
44 < 19 (F)
.
.
.
.
.
.
.
.
.
.
.
minj = 6
minx = 19
.
.
.
.
.
.
.
.
.
.
Inner For Loop terminate
Effect on array
10 14 27 33 35 19 42 44
4442273533191410
Array : T 10 14 19 33 35 27 42 44
.
.
.
.
.
.
.
.
.
4th Iteration
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
minj = 4
minx = 33
.
.
.
.
.
.
.
.
.
Inner For Loop
j = 5
.
.
.
j = 6
.
.
.
j = 7
.
.
.
j = 8
.
.
.
35 < 33 (F)
.
.
.
27 < 33 (T)
.
.
.
42 < 27 (F)
.
.
.
44 < 27 (F)
.
.
.
.
.
.
.
minj = 6
minx = 27
.
.
.
.
.
.
.
.
.
.
Inner For Loop terminate
Effect on array
10 14 19 33 35 27 42 44
4442333527191410
Inner For Loop
j = 6
.
.
.
j = 7
.
.
.
j = 8
.
.
.
.
.
.
.
.
minj = 5
minx = 35
.
.
.
.
.
.
.
.
.
.
.
.
5th Iteration
.
.
.
.
.
.
10Array : T 14 19 27 35 33 42 44
33 < 35 (T)
.
.
.
42 < 33 (F)
.
.
.
44 < 33 (F)
.
.
.
minj = 6
minx = 33
.
.
.
.
.
.
.
.
.
.
Inner For Loop terminate
Effect on array
10 14 19 27 35 33 42 44
4442353327191410
Effect on array
10 14 19 27 33 35 42 44
(No Change)
4442353327191410
Inner For Loop terminate
.
.
.
.
.
.
.
.
42 < 35 (F)
.
.
.
44 < 35 (F)
.
.
.
j = 7
.
.
.
j = 8
.
.
.
Inner For Loop
.
minj = 6
minx = 35
.
.
.
.
6th Iteration
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Array : T 10 14 19 27 33 35 42 44
.
.
7th Iteration
.
.
.
minj = 7
minx = 42
.
.
Array : T 10 14 19 27 33 35 42 44
j = 8
.
.
.
42 < 44 (F)
.
.
.
.
.
.
.
Inner For Loop terminate
Effect on array
10 14 19 27 33 35 42 44
4442353327191410
(No Change)