# Selection Sort in JAVA

03:30

__What is selection sort?__It is a sorting technique that is based on the partitioning of array into two parts, sorted and unsorted.

The process is:-

1) Find minimum element in unsorted array.

2) Swap the element at the end of sorted array.

when i=0 we don't have any sorted array so element will be replaced from first element later the sorted array end will growas the index.

__Steps:-__underline elements are sorted array, the length is increasing with each minimum element added at the end.

minimum element111125 12 22 64 minimum element1211 1225 22 64 minimum element2211 12 2225 64 minimum element2511 12 22 2564 minimum element6411 12 22 25 64

__Program:-__package sorting; public class SelectionSort { //function to print array public static void print(int[] arr) { for(int i=0;i<=arr.length-1;i++) System.out.print(" "+arr[i]); System.out.println(" "); } //function to swap elements public static int[] swap(int[] arr,int i, int j) { int temp; temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; return arr; } //program to find minimum element in unsorted array( i to end) public static int min(int[] arr,int i) { int min=i; for(;i<=arr.length-1;i++) { if(arr[i]<arr[min]) { min=i; } } System.out.println("minimum element"+arr[min]); return min; } public static void main(String[] args) { int[] arr={64,25,12,22,11}; int min; for(int i=0;i<=arr.length-1;i++) { //find minimum element in unsorted array ( i to end) min=min(arr,i); //swap minimum element with then end of sorted array(i) swap(arr,min,i); //print the array print(arr); } } }

## 0 comments