# DSA using Java - Selection Sort

## Overview

Selection sort is a simple sorting algorithm. This sorting algorithm is a in-place comparison based algorithm in which the list is divided into two parts, sorted part at left end and unsorted part at right end. Initially sorted part is empty and unsorted part is entire list.

Smallest element is seleced from the unsorted array and swapped with the leftmost element and that element becomes part of sorted array. This process continues moving unsorted array boundary by one element to the right.

This algorithm is not suitable for large data sets as its average and worst case complexity are of O(n2) where n are no. of items.

## Pseudocode

```Selection Sort ( A: array of item)
procedure selectionSort( A : array of items )
int indexMin
for i = 1 to length(A) - 1 inclusive do:
/* set current element as minimum*/
indexMin = i
/* check the element to be minimum */
for j = i+1 to length(A) - 1 inclusive do:
if(intArray[j] < intArray[indexMin]){
indexMin = j;
}
end for
/* swap the minimum element with the current element*/
if(indexMin != i) then
swap(A[indexMin],A[i])
end if
end for
end procedure
```

## Demo Program

```package com.tutorialspoint.simplesort;

import java.util.Arrays;

public class SelectionSortDemo {

public static void main(String[] args){
int[] sourceArray = {4,6,3,2,1,9,7};
System.out.println("Input Array: "
+ Arrays.toString(sourceArray));
printline(50);
System.out.println("Output Array: "
+ Arrays.toString(selectionSort(sourceArray)));
printline(50);
}

public static void printline(int count){
for(int i=0;i <count-1;i++){
System.out.print("=");
}
System.out.println("=");
}

public static int[] selectionSort(int[] intArray){

int indexMin;
// loop through all numbers
for(int i=0; i < intArray.length-1; i++){
// set current element as minimum
indexMin = i;
// check the element to be minimum
for(int j=i+1;j<intArray.length;j++){
if(intArray[j] < intArray[indexMin]){
indexMin = j;
}
}

if(indexMin != i){
System.out.println("     Items swapped: [ "
+ intArray[i] + ", " + intArray[indexMin] +" ]" );
// swap the numbers
int temp=intArray[indexMin];
intArray[indexMin] = intArray[i];
intArray[i] = temp;
}

System.out.println("iteration "+(i+1) +"#: "
+ Arrays.toString(intArray));
}
return intArray;
}
}
```

If we compile and run the above program then it would produce following result −

```Input Array: [4, 6, 3, 2, 1, 9, 7]
==================================================
Items swapped: [ 4, 1 ]
iteration 1#: [1, 6, 3, 2, 4, 9, 7]
Items swapped: [ 6, 2 ]
iteration 2#: [1, 2, 3, 6, 4, 9, 7]
iteration 3#: [1, 2, 3, 6, 4, 9, 7]
Items swapped: [ 6, 4 ]
iteration 4#: [1, 2, 3, 4, 6, 9, 7]
iteration 5#: [1, 2, 3, 4, 6, 9, 7]
Items swapped: [ 9, 7 ]
iteration 6#: [1, 2, 3, 4, 6, 7, 9]
Output Array: [1, 2, 3, 4, 6, 7, 9]
==================================================
```