Selection sort in java

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview programs.

Selection sort is an in place comparison sorting algorithm. It is very simple to implement but it does not go well with large number of inputs.

Table of Contents

Selection sort algorithm
Selection sort algorithm
Time complexity

Selection sort algorithm

Find the minimum element in the list.
Swap minimum element with current element.
Repeat the whole process until array is fully sorted.

Below visualization will make it more clear

Selection sort algorithm

package org.arpit.java2blog;

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));

}

When you run above program, you will get below output:

Before Sorting :

[40, 10, -30, 45, 39, 32]

===================

After Sorting :

[-30, 10, 32, 39, 40, 45]

Time complexity

Best case : O(N^2) Average case : O(N^2) Worst case : O(N^2)

To understand more about complexity,please go through complexity of algorithm.

Algorithm Interview Sorting

04 November

Topological Sort in java

In this post, we will see about Topological Sorting in the graph. Topological Sorting is ordering of vertices or nodes such if there is an edge between (u,v) then u should come before v in topological sorting. Topological sort is possible only for Directed Acyclic Graph(DAG). If there is a cycle in graph, then there […]

Array Sorting

23 August

Sort array in java

In this post, we will see how to sort an array in java. There are various ways to sort array in java. You can implement different sorting algorithms to sort an array. You can use Arrays.sort method to sort array in java. There are various overloaded versions of Arrays.sort method. You can go through it […]

Algorithm Interview Sorting

12 October

Shell sort in java

Shell sort is in place comparison based sorting algorithm. It is generalization of insertion sort. It was invented by Donald shell. It allows to sort elements which are far apart. In case of insertion sort, comparison happens between only adjacent elements but in shell sort, it avoid comparing adjacent elements until last steps. Last step of shell […]

Algorithm Interview Sorting

12 October

Quick Sort in java

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. Quick sort or partition-exchange sort, is a sorting algorithm, which is using divide and conquer algorithm. In quick sort, we first choose a pivot and divide into two sublists,one will contain elements lower than pivot and […]

Algorithm Interview Sorting

12 October

Counting Sort in java

Counting sort is special sorting technique used to sort elements between specific range. Lets say elements belong to range 1 to K , then Counting sort can be used to sort elements in O(N) times. Basic idea of counting sort to find number of elements less than X, so X can be put to its […]

Algorithm Interview Sorting

12 October

Heap sort in java

In this post, we will see how to implement heap sort in java. I will divide heap sort in multiple parts to make it more understandable. What is heap? A heap is a tree with some special properties, so value of node should be greater than or equal to(less than or equal to in case […]

Selection sort in java

Selection sort algorithm

Selection sort algorithm

Time complexity

Author