Selection Sort - Swarthmore Collegealinen/cs21/f18/w10/... · Selection Sort 0 1 2 3 4 5 start 0...
23
Selection Sort
Transcript of Selection Sort - Swarthmore Collegealinen/cs21/f18/w10/... · Selection Sort 0 1 2 3 4 5 start 0...
Selection Sort
Selection Sort
10 4 3 0 11 8
0 1 2 3 4 5
What do we do first?
Selection Sort0 1 2 3 4 5
start0
Find minimum element idx between start to end
10 4 3 0 11 8
What next?
minValIdx3
Selection Sort0 1 2 3 4 5
start0
Swap the elements at start and minValIdx
0 4 3 10 11 8
What next?
minValIdx3
Selection Sort0 1 2 3 4 5
start1
Decrease the interval.
0 4 3 10 11 8
What next?
Selection Sort0 1 2 3 4 5
start1
Find minimum element between start to end
0 4 3 10 11 8
What next?
minValIdx2
Selection Sort0 1 2 3 4 5
start1
Swap the elements at start and minValIdx
0 3 4 10 11 8
What next?
minValIdx2
Selection Sort0 1 2 3 4 5
start2
Decrease the interval.
0 3 4 10 11 8
What next?
Selection Sort0 1 2 3 4 5
start2
Find minimum element idx between start to end
0 3 4 10 11 8
What next?
minValIdx2
Selection Sort0 1 2 3 4 5
start2
Swap the elements at start and minValIdx
0 3 4 10 11 8
What next?
minValIdx2
Selection Sort0 1 2 3 4 5
start3
Decrease the interval.
0 3 4 10 11 8
What next?
Selection Sort0 1 2 3 4 5
start3
Find minimum element idx between start to end
0 3 4 10 11 8
What next?
minValIdx5
Selection Sort0 1 2 3 4 5
Swap the elements at start and minValIdx
0 3 4 8 11 10
What next?
start3
minValIdx5
Selection Sort0 1 2 3 4 5
start4
Decrease the interval.
0 3 4 8 11 10
What next?
Selection Sort0 1 2 3 4 5
start4
Find minimum element idx between start to end
0 3 4 8 11 10
What next?
minValIdx5
Selection Sort0 1 2 3 4 5
Swap the elements at start and minValIdx
0 3 4 8 10 11
What next?
start4
minValIdx5
Selection Sort0 1 2 3 4 5
start5
Decrease the interval.
0 3 4 8 10 11
We’re done!
Selection sortselectionSort(L):
for startIdx in range(len(L)):
minIdx = findMinimum(startIdx, L)
swap(startIdx, minIdx, L)
Selection sortfindMinimum(startIdx, L):
minIdx = startIdx
for i in range(startIdx, len(L)):
if L[i] < L[minIdx]:
minIdx = i
return minIdx
Selection sortswap(i, j, L):
temp = L[i] # step 1
L[i] = L[j] # step 2
L[j] = temp # step 3
Temp i j
Temp i j
Temp i j
Temp i j
![Sorting. Pseudocode of Insertion Sort Insertion Sort To sort array A[0..n-1], sort A[0..n-2] recursively and then insert A[n-1] in its proper place among.](https://static.fdocuments.us/doc/165x107/5697bfe21a28abf838cb496a/sorting-pseudocode-of-insertion-sort-insertion-sort-to-sort-array-a0n-1.jpg)
