Breaking News: Grepper is joining You.com. Read the official announcement!

Java Selection Sort

Wild Wolverine answered on January 11, 2022 Popularity 10/10 Helpfulness 2/10

answer Java Selection Sort

related Selection sort java

Java Selection Sort

Comment

// Java Selection Sort
// -------------------

/* 
   Time Complexity
     Best Time Complexity:O(n^2)
	 Average Time Complexity:O(n^2)
	 Worst Time Complexity:O(n^2)
     
   Space Complexity
     No auxiliary space is required in Linear Search implementation.
	 Hence space complexity is:O(1)
*/

import java.util.*;

public class SelectionSort {
    public static int[] sort(int arr[]) {
        for (int i = 0; i < arr.length; i++) {
            int k = i; // referring to current index
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[j] < arr[k]) {
                    k = j;
                }
            }
            int temp;

            //Swapping algorithm
            temp = arr[i];
            arr[i] = arr[k];
            arr[k] = temp;
        }

        return arr; // returns the sorted array
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int arr[] = new int[10];

        System.out.println("Enter Array Values: ");
        for (int i = 0; i < arr.length; i++) {
            arr[i] = sc.nextInt();
        }

        int a[] = new int[arr.length];

        a = Arrays.copyOf(sort(arr), arr.length); // copies the sorted array to another array

		//sorted in ascending order
        System.out.println("Sorted Array:");
        for (int i = 0; i < a.length; i++) {
            System.out.print(+a[i] + " ");
        }
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java selection-sort

Link to this answer
Share Copy Link

Contributed on Aug 21 2022

Wild Wolverine

0 Answers Avg Quality 2/10

Closely Related Answers

Selection sort java

Comment

// Java program for implementation of Selection Sort
class SelectionSort
{
    void sort(int arr[])
    {
        int n = arr.length;

        // One by one move boundary of unsorted subarray
        for (int i = 0; i < n-1; i++)
        {
            // Find the minimum element in unsorted array
            int min_idx = i;
            for (int j = i+1; j < n; j++)
                if (arr[j] < arr[min_idx])
                    min_idx = j;

            // Swap the found minimum element with the first
            // element
            int temp = arr[min_idx];
            arr[min_idx] = arr[i];
            arr[i] = temp;
        }
    }

    // Prints the array
    void printArray(int arr[])
    {
        int n = arr.length;
        for (int i=0; i<n; ++i)
            System.out.print(arr[i]+" ");
        System.out.println();
    }

    // Driver code to test above
    public static void main(String args[])
    {
        SelectionSort ob = new SelectionSort();
        int arr[] = {64,25,12,22,11};
        ob.sort(arr);
        System.out.println("Sorted array");
        ob.printArray(arr);
    }
}
/* This code is contributed by Rajat Mishra*/

Popularity 10/10 Helpfulness 3/10 Language java

Source: www.geeksforgeeks.org

Tags: java

Link to this answer
Share Copy Link

Contributed on Jan 11 2022

Tame Turtle

0 Answers Avg Quality 2/10

Java Selection Sort

Contents

More Related Answers

Java Selection Sort

Closely Related Answers

Selection sort java

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.