Java Source Code: Sort Numbers in Selection Sort

source:linux-mag.com

Below is the sample java source code on sorting numbers using selection sort. Selection Sort in java is much prepared by the programmers when it comes on sorting. Here, I will present to you on how the selection sort works.

How Selection Sort works in Java?

Assuming the user entered 6 numbers which are:

4 5 1 3 2 6

The program will sort it in an ascending order using selection sort. The program will simply compare the first number which is 4 to the second number, third number and so on, and then sort. See below on how it works.

From the entered numbers 4 5 1 3 2 6

Sorted To:

5 1 3 2 4 6

1 3 2 4 5 6

1 2 3 4 5 6 //sorting ends here and this will be output to the screen.

Sorting in selection sort is pretty fast than bubble sort. But If you are interested on comparing other methods of sorting like bubble sort , you can visit the link below.

Java Source Code: How to Sort Numbers in Bubble Sort Using Recursion

Below is the java source code for Selection Sort.

Java Source Code: How to Sort Numbers using Selection Sort

//java class

public class SelectionSort
{

     public void SelectionSort(int[] arr){
     for(int i=0; i<arr.length; i++)
     {
        for(int j=i+1; j<arr.length; j++)
        {
            if(arr[i] > arr[j] )
            {
                int temp = arr[j];
                arr[j] = arr[i];
                arr[i] = temp;
            }
        }
     }

     for(int i=0; i<arr.length; i++)
     {
         System.out.print(arr[i] + " ");
     }
}

//main class


import java.util.Scanner;

public class Main
{

    public static void main(String[] args)
    {

        Scanner input = new Scanner(System.in);

        System.out.print("Enter the size of the array: ");
        int n = input.nextInt();
        int[] x = new int[n];

        System.out.print("Enter "+ n +" numbers: ");
        for(int i=0; i<n; i++)
        {
            x[i] = input.nextInt();
        }

        SelectionSort access = new  SelectionSort();
        System.out.print("The Sorted numbers: ");
        access.SelectionSort(x);
    }

}

Sample Output:

Enter the size of the array: 10

Enter 10 numbers: 500 600 250 1000 35 50 10 15 20 1

The Sorted numbers: 1 10 15 20 35 50 250 500 600 1000

Available Java E-books

	Computer Programming for Teens (For Teens (Course Technology)) Amazon Price: $15.00 List Price: $29.99
	Introduction to Java Programming, Comprehensive (8th Edition) Amazon Price: $75.00 List Price: $137.00
	Murach's Java Programming Amazon Price: $35.00 List Price: $57.50
	Head First Java, 2nd Edition Amazon Price: $20.00 List Price: $44.95