The Selection Sort
Mr. Dave Clausen La Caada High School
The Selection Sort Description
The Selection Sort searches (linear search) all of the elements in a list until it finds the smallest element. It swaps this with the first element in the list. Next it finds the smallest of the remaining elements, and swaps it with the second element. Repeat this process until you compare only the last two elements in the list.
Mr. Dave Clausen
The Selection Sort Algorithm
For each index position i
Find the smallest data value in the array from positions i through length - 1, where length is the number of data values stored. Exchange (swap) the smallest value with the value at position i.
Mr. Dave Clausen 3
A Selection Sort Example
Smallest ?
We start by searching for the smallest element in the List.
6 2 1 3 5 4
4
Mr. Dave Clausen
A Selection Sort Example
Smallest ?
6 2 1 3 5 4
5
Mr. Dave Clausen
A Selection Sort Example
6 2 1 3 5 4
6
Smallest !
Mr. Dave Clausen
A Selection Sort Example
6 2 1 3 5 4
7
Swap
Mr. Dave Clausen
A Selection Sort Example
1 2 6 3 5 4
8
Swapped
Mr. Dave Clausen
A Selection Sort Example
Smallest ?
After the smallest element is in the first position, we continue searching with the second element and look for the next smallest element.
Mr. Dave Clausen
1 2 6 3 5 4
9
A Selection Sort Example
Smallest !
In this special case, the next smallest element is in the second position already. Swapping keeps it in this position.
Mr. Dave Clausen
1 2 6 3 5 4
10
A Selection Sort Example
Swapped
Swapping keeps it in this position.
1 2 6 3 5 4
11
Mr. Dave Clausen
A Selection Sort Example
1 2 6 3 5 4
12
Smallest ?
After the next smallest element is in the second position, we continue searching with the third element and look for the next smallest element.
Mr. Dave Clausen
A Selection Sort Example
1 2 6 3 5 4
13
Smallest !
Mr. Dave Clausen
A Selection Sort Example
1 2 6 3 5 4
14
Swap
Mr. Dave Clausen
A Selection Sort Example
1 2 3 6 5 4
15
Swapped
Mr. Dave Clausen
A Selection Sort Example
1 2 3 6 5 4
16
Smallest ?
Mr. Dave Clausen
A Selection Sort Example
1 2 3 6 5 4
17
Smallest ?
Mr. Dave Clausen
A Selection Sort Example
1 2 3 6 5 4
18
Smallest !
Mr. Dave Clausen
A Selection Sort Example
1 2 3 6 5 4
19
Swap
Mr. Dave Clausen
A Selection Sort Example
1 2 3 4 5 6
20
Swapped
Mr. Dave Clausen
A Selection Sort Example
1 2 3 4 5 6
21
The last two elements are in order, so no swap is necessary.
Mr. Dave Clausen
What Swapping Means
TEMP
6
Place the first element into the Temporary Variable.
6 2 1 3 5 4
22
Mr. Dave Clausen
What Swapping Means
TEMP
6
Replace the first element with the value of the smallest element.
1 2 1 3 5 4
23
Mr. Dave Clausen
What Swapping Means
TEMP
6
Replace the third element (in this example) with the Temporary Variable.
1 2 6 3 5 4
24
Mr. Dave Clausen
Java Source Code: Selection Sort
public static void selectionSort(int[] list) { for (int index = 0; index < list.length - 1; index ++) { int minIndex = findMinimum(list, index ); if (minIndex != index ) swap(list, index , minIndex); } }
Mr. Dave Clausen 25
Java Code For Find Minimum
public static int findMinimum(int[] list, int first) { int minIndex = first; for (int index = first + 1; index < list.length; index ++) if (list[index] < list[minIndex]) minIndex = index ; return minIndex; }
Mr. Dave Clausen 26
Java Code for Swap Procedure
public static void swap(int[] list, int x, int y) { int temp = list[x]; list[x] = list[y]; list[y] = temp; }
Mr. Dave Clausen
27
C ++ Code For Selection Sort
void Selection_Sort (apvector <int> & v) { int min_index = 0; for (int index = 0; index < v.length( ) - 1; ++index) { min_index = Find_Minimum (v, index); if (min_index ! = index) Swap_Data ( v [index], v [min_index]) } } // Selection_Sort
Mr. Dave Clausen 28
C ++ Code For Find Minimum
int Find_Minimum (const apvector <int> & v, int first) { int min_index = first; for (int index = first + 1; index < v.length( ); ++index) if ( v[index] < v[min_index]) min_index = index; return min_index; } // Find_Minimum
Mr. Dave Clausen
29
C ++ Code for Swap Procedure
void Swap_Data (int &number1, int &number2) { int temp; temp = number1; number1 = number2; number2 = temp; } // End of Swap_Data function
Mr. Dave Clausen
30
Pascal Code For Selection Sort
procedure SelectionSort (var IntArray: IntNumbers); var element, SmallIndex, index: integer; begin for element := 1 to (MaxNum - 1) do begin SmallIndex := element; for index := (element + 1) to MaxNum do if IntArray [index] < IntArray [SmallIndex] then SmallIndex := index; Swap (IntArray [element], IntArray [SmallIndex]) end; end; {SelectionSort}
Mr. Dave Clausen 31
Pascal Code for Swap Procedure
procedure Swap (var number1, number2: integer); var temp: integer; begin temp := number1; number1 := number2; number2 := temp end; {Swap}
Mr. Dave Clausen
32
BASIC Code For Selection Sort
8000 REM ################# 8010 REM Selection Sort 8020 REM ################# 8030 FOR ELEMENT = 1 TO MAXNUM - 1 8040 ::SmallIndex = element 8050 ::FOR INDEX = (element + 1) TO MAXNUM 8060 ::::::IF N (INDEX) < N (SmallIndex) THEN SmallIndex = INDEX 8070 ::NEXT INDEX 8080 ::TEMP = N (element) 8090 ::N (element) = N (SmallIndex) 8100 ::N (SmallIndex) = TEMP 8110 NEXT ELEMENT 8120 RETURN
Mr. Dave Clausen 33
Big - O Notation
Big - O notation is used to describe the efficiency of a search or sort. The actual time necessary to complete the sort varies according to the speed of your system. Big - O notation is an approximate mathematical formula to determine how many operations are necessary to perform the search or sort. The Big - O notation for the Selection Sort is O(n2), because it takes approximately n2 passes to sort the elements.
Mr. Dave Clausen 34
