GeezerVison is showing github.com — Java/Programs/SelectionSort.java at main · PandaWire/Java

Expand file tree

SelectionSort.java

Copy path

More file actions

34 lines (29 loc) · 873 Bytes

Copy path

34 lines (29 loc) · 873 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

// Java program that implements selection sort

// Best case : O(N^2)

// Average case : O(N^2)

// Worst case : O(N^2)

import java.util.Arrays;

public class SelectionSortMain {

public static int[] selectionSort(int[] arr){

for (int i = 0; i < arr.length - 1; i++)

{

int index = i;

for (int j = i + 1; j < arr.length; j++)

if (arr[j] < arr[index])

index = j;

int smallerNumber = arr[index];

arr[index] = arr[i];

arr[i] = smallerNumber;

}

return arr;

}

public static void main(String a[]){

int[] arr = {40,10,-30,45,39,32};

System.out.println("Before Sorting : ");

System.out.println(Arrays.toString(arr));

arr = selectionSort(arr);

System.out.println("===================");

System.out.println("After Sorting : ");

System.out.println(Arrays.toString(arr));

}