![\"Selection](\"http:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/SelectionSortExample.png\" "\\"\\"")
<\/p>\nIn this tutorial, we will learn to write a Java Program for Selection Sort. Selection sort is one of the simple sorting techniques.<\/p>\n
Sorting is a process of arranging things in a specified order, for example in ascending or descending order. There are many algorithms for sorting.<\/p>\n
Consider array a, using this technique you will find the smallest element in the list and interchange it with the first element in the list i.e a[0]. In the next pass, you will find the next smallest element in the rest of the list ( a[1]\u2026. end of the list ) and interchange with the element a[1] so on…<\/p>\n
After all the array passes you will be left with the sorted array.<\/p>\n
<\/p>\n
<\/p>\n
Some steps and instructions to create a Java application on Eclipse IDE:<\/p>\n
https:\/\/www.testingdocs.com\/create-a-new-java-project-in-eclipse\/<\/a><\/p>\n https:\/\/www.testingdocs.com\/create-java-package-in-eclipse-ide\/<\/a><\/p>\n https:\/\/www.testingdocs.com\/create-a-new-java-class-in-a-project\/<\/a><\/p>\n https:\/\/www.testingdocs.com\/run-java-project-in-eclipse\/<\/a><\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n Enter size of the array: <\/p>\n —<\/p>\n Java Tutorial on this website: https:\/\/www.testingdocs.com\/java-tutorial\/<\/a><\/strong><\/p>\n For more information on Java, visit the official website :<\/p>\n\n
\n
\n
Java program<\/strong><\/h2>\n
import java.util.InputMismatchException;\r\nimport java.util.Scanner;\r\n\r\npublic class SelectionSort {\r\n public static void main(String[] args) {\r\n int n , minIndex;\r\n Scanner input = null;\r\n int[] a = null;\r\n try {\r\n input=new Scanner(System.in);\r\n System.out.println(\"Enter size of the array:\");\r\n n= input.nextInt();\r\n\r\n if(n > 0) {\r\n a=new int[n];\r\n System.out.println(\"Enter array elements:\");\r\n for (int i = 0; i < n; i++) {\r\n a[i] = input.nextInt();\r\n }\r\n }else{\r\n System.out.println(\"Enter positive number.\");\r\n System.exit(0);\r\n }\r\n\r\n System.out.println(\"Input Array:\");\r\n printArray(a);\r\n\r\n for(int i=0;i<a.length;i++){\r\n minIndex=i;\r\n for(int j=i+1;j<a.length;j++){\r\n if(a[j]<a[minIndex])\r\n minIndex=j;\r\n }\r\n swap(a,i,minIndex);\r\n System.out.println(\"Smallest element marked **\") ;\r\n printArray(a,i);\r\n }\r\n System.out.println(\"Sorted Array:\");\r\n printArray(a);\r\n }catch (InputMismatchException ime) {\r\n System.out.println(\"Not a valid input\");\r\n }\r\n catch (Exception e) {\r\n e.printStackTrace();\r\n } finally {\r\n if(input!=null)\r\n {input.close();}\r\n }\r\n }\r\n\r\n private static void printArray(int[] a){\r\n for (int anA : a) {\r\n System.out.print(\"[ \" + anA + \" ]\");\r\n }\r\n System.out.println( \"\");\r\n }\r\n\r\n private static void printArray(int[] a, int index){\r\n for (int i=0;i< a.length;i++) {\r\n if(i == index)\r\n System.out.print(\"[* \" + a[i] + \"*]\");\r\n else\r\n System.out.print(\"[ \" + a[i] + \" ]\");\r\n }\r\n System.out.println( \"\");\r\n }\r\n\r\n private static void swap( int[] a, int i , int j)\r\n {\r\n int temp = a[i];\r\n a[i] = a[j];\r\n a[j] = temp;\r\n }\r\n}<\/pre>\nRun output<\/strong><\/h2>\n
![\"Selection](\"http:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Selection-Sort-Program.png\" "\\"\\"")
<\/p>\n
\n5
\nEnter array elements:
\n23
\n56
\n9
\n103
\n77
\nInput Array:
\n[ 23 ][ 56 ][ 9 ][ 103 ][ 77 ]
\nSmallest element marked **
\n[* 9*][ 56 ][ 23 ][ 103 ][ 77 ]
\nSmallest element marked **
\n[ 9 ][* 23*][ 56 ][ 103 ][ 77 ]
\nSmallest element marked **
\n[ 9 ][ 23 ][* 56*][ 103 ][ 77 ]
\nSmallest element marked **
\n[ 9 ][ 23 ][ 56 ][* 77*][ 103 ]
\nSmallest element marked **
\n[ 9 ][ 23 ][ 56 ][ 77 ][* 103*]
\nSorted Array:
\n[ 9 ][ 23 ][ 56 ][ 77 ][ 103 ]<\/p>\n