Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 6 2

Largest

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Comparison

Data Movement

Sorted
 Selection Sort

5 1 3 4 2 6

Largest

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Largest

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Largest

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

2 1 3 4 5 6

Largest

Comparison

Data Movement

Sorted
 Selection Sort

1 2 3 4 5 6

Comparison

Data Movement

Sorted
 Selection Sort

1 2 3 4 5 6
DONE!
Comparison

Data Movement

Sorted
 Selection sort
• Given an array of length n,
– Search elements 0 through n-0 and select the smallest
• Swap it with the element in location 0
– Search elements 1 through n-1 and select the smallest
• Swap it with the element in location 1
– Search elements 2 through n-2 and select the smallest
• Swap it with the element in location 2
– Search elements 3 through n-3 and select the smallest
• Swap it with the element in location 3
– Continue in this fashion until there’s nothing left to
search
public static void selection_srt(int array[], int n)
{
for(int x=0; x<n-1; x++){
int index_of_min = x;
for(int y=x; y<n; y++){
if(array[index_of_min]>array[y]){
index_of_min = y;
}
}
int temp = array[x];
array[x] = array[index_of_min];
array[index_of_min] = temp;
}
}
}