Java Program to Perform Selection Sort

Write a Java program to perform selection sort using for loop. This example allows one to enter size and items and perform selection sort on arrays using nested for loops.

package Remaining;

import java.util.Scanner;

public class SelectionSort1 {
	private static Scanner sc;
	
	public static void main(String[] args) {
		int Size, i, j, temp;
		
		sc = new Scanner(System.in);		
		System.out.print("Please Enter the Array size = ");
		Size = sc.nextInt();
		
		int[] arr = new int[Size];
		
		System.out.format("Enter Array %d elements = ", Size);
		for(i = 0; i < Size; i++) {
			arr[i] = sc.nextInt();
		}
		
		for(i = 0; i < arr.length  - 1; i++)
		{
			int min = i;
			
			for(j = i + 1; j < arr.length; j++)
			{
				if(arr[j] < arr[min])
				{
					min = j;
				}
			}
			temp = arr[min];
			arr[min] = arr[i];
			arr[i] = temp;
			
		}
		System.out.print("\nThe Selection Sort Output = ");
		for(i = 0; i < arr.length; i++) 
		{
			System.out.print(arr[i] + "  ");
		}
	}
}

Java Program to Perform Selection Sort using while loop

This program helps to perform selection sort on arrays using a while loop.

package Remaining;

import java.util.Scanner;

public class Example2 {
	private static Scanner sc;
	
	public static void main(String[] args) {
		int Size, i, j, temp;
		
		sc = new Scanner(System.in);		
		System.out.print("Please Enter the size = ");
		Size = sc.nextInt();
		
		int[] arr = new int[Size];
		
		System.out.format("Enter %d elements = ", Size);
		i = 0; 
		while(i < Size) {
			arr[i] = sc.nextInt();
			i++;
		}
		
		i = 0; 
		while(i < arr.length - 1)
		{
			int min = i;
			j = i + 1;
			
			while(j < arr.length)
			{
				if(arr[j] < arr[min])
				{
					min = j;
				}
				j++;
			}
			temp = arr[min];
			arr[min] = arr[i];
			arr[i] = temp;
			i++;
		}
		System.out.print("\nOutput = ");
		i = 0; 
		while(i < arr.length) 
		{
			System.out.print(arr[i] + "  ");
			i++;
		}
	}
}

Please Enter the size = 9
Enter 9 elements = 89 75 22 11 99 126 6 33 50

Output = 6  11  22  33  50  75  89  99  126  

It is another way of writing a program to perform selection sort on arrays.

package Remaining;

import java.util.Scanner;

public class Example3 {
	private static Scanner sc;
	
	public static void main(String[] args) {
		int Size, i, j, temp;
		
		sc = new Scanner(System.in);		
		System.out.print("Please Enter the size = ");
		Size = sc.nextInt();
		
		int[] arr = new int[Size];
		
		System.out.format("Enter %d elements = ", Size);
		for(i = 0; i < Size; i++) {
			arr[i] = sc.nextInt();
		}
		
		for(i = 0; i < arr.length; i++)
		{	
			for(j = i + 1; j < arr.length; j++)
			{
				if(arr[i] > arr[j])
				{
					temp = arr[i];
					arr[i] = arr[j];
					arr[j] = temp;
				}
			}		
		}
		
		System.out.print("\nOutput = ");
		for(i = 0; i < arr.length; i++) 
		{
			System.out.print(arr[i] + "  ");
		}
	}
}

Please Enter the size = 8
Enter 8 elements = 22 98 76 43 56 19 72 100

Output = 19  22  43  56  72  76  98  100