Java Program for Selection Sorting

What is selection sort ?

Selection sorting is based on the idea of finding the minimum element or maximum element in an unsorted list of elements and then putting each elements in correct position in order to get sorted list of elements.

In the i'th pass, we select the record with lowest key among array[i],..., array[n] and we swap it with array[i]. As a result after i passes, the lowest records will occupy array[1],..., array[i] in sorted order.

Selection Sorting Steps

selection sorting

Selection Sorting Time complexity

Selection sorting time complexity is O(N^2). here N is the number of elements in the list, (N−1)(N−1) + (N−2)(N−2) + ... + 1 = (N(N−1))/2 comparisons.

Selection Sorting Java Program

This java program is used to sort the array of integers using selection sorting technique with finding minimum value index to swap with current index value in each iteration.

import java.util.Scanner;

public class SelectionSortingTest {
	// Swaps the min element and current index value.
	public static void swap(int[] listVals, int minValIndex, int index){
		int temp = listVals[minValIndex];
		listVals[minValIndex] = listVals[index];
		listVals[index] = temp;
	}
                                                          
    public static void selectionSort(int[] listVals){
    	int numberOfElements = listVals.length;
    	//  reduces the each inner iteration loop size by one
    	for(int i=0;i<numberOfElements-1;i++){
    		// position of minimum element in the list                               
    		// Assuming first element to be the minimum
    		int minValIndex = i;
    		// finds minimum value position in the list of elements.
    		for(int j=i+1;j<numberOfElements;j++){
    			if(listVals[j]<listVals[minValIndex]){
    				minValIndex = j;	
    			}
    		}
		swap(listVals, minValIndex, i);
    	}
    }

	public static void main(String[] args){
	    int[] numberList;
	    Scanner in = new Scanner(System.in); 
	    System.out.println("Selection Sorting");
	    System.out.println("--------------------");
	    System.out.println("Enter numbers count: ");                   
	    int count = in.nextInt();                   
	    numberList = new int[count];
	    System.out.println("Enter numbers: "); 
	    for (int i=0;i<count;i++){
	    	numberList[i]=in.nextInt();
	    }
	    in.close();
	    selectionSort(numberList);
	    
	    System.out.println("Sorted numbers: "); 
	    for(int number : numberList){
	    	System.out.print(number+"\t");
	    }
	}
}
Output:
$ javac SelectionSortingTest.java
$ java SelectionSortingTest
Selection Sorting
--------------------
Enter numbers count: 
5
Enter numbers: 
25
17
35
5
18
Sorted numbers: 
5	17	18	25	35

Selection Sorting Java Program using Maximum Element

This java program is used to sort the array of integers using selection sorting technique with finding maximum value index to swap with current index value in each iteration.

import java.util.Scanner;

public class SelectionSortingTest {
	// Swaps the max element and current index value.
	public static void swap(int[] listVals, int maxValIndex, int index){
		int temp = listVals[maxValIndex];
		listVals[maxValIndex] = listVals[index];
		listVals[index] = temp;
	}
                                                          
    public static void selectionSort(int[] listVals){
    	int numberOfElements = listVals.length;
    	//  reduces the each inner iteration loop size by one
    	for(int i=0;i<numberOfElements-1;i++){
    		// position of maximum element in the list                               
    		// Assuming first element to be the maximum
    		int maxValIndex = i;
    		// finds maximum value position in the list of elements.
    		for(int j=i+1;j<numberOfElements;j++){
    			if(listVals[j]<listVals[maxValIndex]){
    				maxValIndex = j;	
    			}
    		}
		swap(listVals, maxValIndex, i);
    	}
    }

	public static void main(String[] args){
	    int[] numberList;
	    Scanner in = new Scanner(System.in); 
	    System.out.println("Selection Sorting");
	    System.out.println("--------------------");
	    System.out.println("Enter numbers count: ");                   
	    int count = in.nextInt();                   
	    numberList = new int[count];
	    System.out.println("Enter numbers: "); 
	    for (int i=0;i<count;i++){
	    	numberList[i]=in.nextInt();
	    }
	    in.close();
	    selectionSort(numberList);
	    
	    System.out.println("Sorted numbers: "); 
	    for(int number : numberList){
	    	System.out.print(number+"\t");
	    }
	}
}   
Output:
$ javac SelectionSortingTest.java
$ java SelectionSortingTest
Selection Sorting
--------------------
Enter numbers count: 
6
Enter numbers: 
24
19
5
34
27
18
Sorted numbers: 
5	18	19	24	27	34

Java Programming Language Examples

GCD and Rational Number Java Program

Java Queue Program using exception

Java Stack Program using exception

Addition of three integers java program

Biggest of three integers java program

Fibonacci numbers java program

Arithmetic Operations Menu java program

Second Smallest Element In Array Java Program

Transpose Of A Matrix Java Program

Java Program to Display triangle of stars (*)

Java Programming Prints Product Tables

Java Program to Display triangle of numbers

Java Programming Gets Current Date

Java Programming Finds Character Vowel or Consonent

Java Programming HCF and LCM Computation

Java Programming Sum of Command Line Integer Arguments

Java Programming Multiplication of Command Line Integer Arguments

Java Programming Multiplication of Command Line Floating Point Numeric Arguments

Java Programming String Contains or Not

Java Programming Gets Grade Description using Switch

Java Programming CSV File Reader

Java Programming Character Frequency Count in String using for each

Java Programming Finds Min from Integer Array by Passing Array to Method

Java Programming Linear Search

Java Programming Binary Search

Java Programming Ternary Search

Java Programming Generates Range of Numbers

Java Programming Generates Range of Characters

Java Programming Computes Square Root Value

Java Programming Checks Number is Positive or Negative

Java Programming Checks Number is Odd or Even

Java Programming Computes Plot Area

Java Programming Convert Number of Days into Years

Java Programming Checks a Year is Leap Year, Century Year or Not

Java Programming Checks a Character is Digit, Letter or neither digit nor letter

Java Programming Checks a Number is Palindrome or not

Java Programming Sum of Two Matrix

Java Programming Power Computation

Java Programming Checks Number is an Armstrong Number or not

Java Programming Temperature Unit Conversions

Java Programming Generates Random Numbers in Specified Range

Java Programming Computes Sum of Digits and Product of Digits

Java Programming Computes Reverse Number

Java Programming Computes Factorial Value

Java Programming Checks Prime Number or not

Java Programming Computes Harmonic Series

Java Programming Generates Floyd's Triangle

Java Programming Reverses String

Java Programming Checks Palindrome String or not

Java Programming Opens Notepad

Java Programming Searches String using RegEx Pattern

Java Programming Searches Word in String

Java Programming Gets System Environment Variables

Java Programming Gets IP Address of Server Name

Java Programming Arrays Sort and Reverse using sort method

Java Programming Bubble Sorting

Java Programming Selection Sorting

Java Programming Insertion Sorting

Java Programming Merge Sorting

Java Programming Quick Sorting

Java Programming Counting Sort

Java Programming Radix Sorting

Java Programming Sorting Array of Strings

Java Programming String Characters Sorting

Java Programming Sum of First N Numbers

Java Programming Product of First N Numbers

Privacy Policy  |  Copyright@2017 - All Rights Reserved.  |  Contact us   |  Report website issues in Github   |  Facebook page   |  Google+ page

Email Facebook Google LinkedIn Twitter
^