Selection Sort

In selection sort, the smallest value among the unsorted elements of the array is selected in every pass and inserted to its appropriate position into the array.

First, find the smallest element of the array and place it on the first position. Then, find the second smallest element of the array and place it on the second position. The process continues until we get the sorted array.

The array with n elements is sorted by using n-1 pass of selection sort algorithm.

In 1st pass, smallest element of the array is to be found along with its index pos. then, swap A[0] and A[pos]. Thus A[0] is sorted, we now have n -1 elements which are to be sorted.
In 2nd pas, position pos of the smallest element present in the sub-array A[n-1] is found. Then, swap, A[1] and A[pos]. Thus A[0] and A[1] are sorted, we now left with n-2 unsorted elements.
In n-1th pass, position pos of the smaller element between A[n-1] and A[n-2] is to be found. Then, swap, A[pos] and A[n-1].

Therefore, by following the above explained process, the elements A[0], A[1], A[2],...., A[n-1] are sorted.

Example

Consider the following array with 6 elements. Sort the elements of the array by using selection sort.

A = {10, 2, 3, 90, 43, 56}.

Pass	Pos	A[0]	A[1]	A[2]	A[3]	A[4]	A[5]
1	1	2	10	3	90	43	56
2	2	2	3	10	90	43	56
3	2	2	3	10	90	43	56
4	4	2	3	10	43	90	56
5	5	2	3	10	43	56	90

Sorted A = {2, 3, 10, 43, 56, 90}

Complexity

Complexity	Best Case	Average Case	Worst Case
Time	Ω(n)	θ(n²)	o(n²)
Space			o(1)

Algorithm

SELECTION SORT(ARR, N)

Step 1: Repeat Steps 2 and 3 for K = 1 to N-1
Step 2: CALL SMALLEST(ARR, K, N, POS)
Step 3: SWAP A[K] with ARR[POS]
[END OF LOOP]
Step 4: EXIT

SMALLEST (ARR, K, N, POS)

Step 1: [INITIALIZE] SET SMALL = ARR[K]
Step 2: [INITIALIZE] SET POS = K
Step 3: Repeat for J = K+1 to N -1
IF SMALL > ARR[J]
SET SMALL = ARR[J]
SET POS = J
[END OF IF]
[END OF LOOP]
Step 4: RETURN POS

C Program

#include<stdio.h>
int smallest(int[],int,int);
void main ()
{
	int a[10] = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
	int i,j,k,pos,temp;
	for(i=0;i<10;i++)
	{
		pos = smallest(a,10,i);
		temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	printf("\nprinting sorted elements...\n");
	for(i=0;i<10;i++)
	{
		printf("%d\n",a[i]);
	}
}
int smallest(int a[], int n, int i)
{
	int small,pos,j;
	small = a[i];
	pos = i;
	for(j=i+1;j<10;j++)
	{
		if(a[j]<small)
		{
			small = a[j];
			pos=j;
		}
	}
	return pos;
}

Output:

printing sorted elements...
7
9
10
12
23
23
34
44
78
101

C++ Program

#include<iostream>
using namespace std;
int smallest(int[],int,int);
int main ()
{
	int a[10] = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
	int i,j,k,pos,temp;
	for(i=0;i<10;i++)
	{
		pos = smallest(a,10,i);
		temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	cout<<"\n printing sorted elements...\n";
	for(i=0;i<10;i++)
	{
		cout<<a[i]<<"\n";
	}
	return 0;
}
int smallest(int a[], int n, int i)
{
	int small,pos,j;
	small = a[i];
	pos = i;
	for(j=i+1;j<10;j++)
	{
		if(a[j]<small)
		{
			small = a[j];
			pos=j;
		}
	}
	return pos;
}

Output:

printing sorted elements...
7
9
10
12
23
23
34
44
78
101

Java Program

public class SelectionSort {
public static void main(String[] args) {
	int[] a = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
	int i,j,k,pos,temp;
	for(i=0;i<10;i++)
	{
		pos = smallest(a,10,i);
		temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	System.out.println("\nprinting sorted elements...\n");
	for(i=0;i<10;i++)
	{
		System.out.println(a[i]);
	}
}
public static int smallest(int a[], int n, int i)
{
	int small,pos,j;
	small = a[i];
	pos = i;
	for(j=i+1;j<10;j++)
	{
		if(a[j]<small)
		{
			small = a[j];
			pos=j;
		}
	}
	return pos;
}
}

Output:

printing sorted elements...
7
9
10
12
23
23
34
44
78
101

C# Program

using System;				
public class Program
{
	
	
public void Main() {
	int[] a = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
	int i,pos,temp;
	for(i=0;i<10;i++)
	{
		pos = smallest(a,10,i);
		temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	Console.WriteLine("\nprinting sorted elements...\n");
	for(i=0;i<10;i++)
	{
		Console.WriteLine(a[i]);
	}
}
public static int smallest(int[] a, int n, int i)
{
	int small,pos,j;
	small = a[i];
	pos = i;
	for(j=i+1;j<10;j++)
	{
		if(a[j]<small)
		{
			small = a[j];
			pos=j;
		}
	}
	return pos;
}
}

Output:

printing sorted elements...
7
9
10
12
23
23
34
44
78
101

Python Program

def smallest(a,i):
    small = a[i]
    pos=i
    for j in range(i+1,10):
        if a[j] < small:
            small = a[j] 
            pos = j 
    return pos 
    
a=[10, 9, 7, 101, 23, 44, 12, 78, 34, 23]
for i in range(0,10):
    pos = smallest(a,i)
    temp = a[i]
    a[i]=a[pos]
    a[pos]=temp
print("printing sorted elements...")
for i in a:
    print(i)

Output:

printing sorted elements...
7
9
10
12
23
23
34
44
78
101

Rust Program

fn main ()
{
	let mut a: [i32;10] = [10, 9, 7, 101, 23, 44, 12, 78, 34, 23];
	
	for i in 0..10
	{
	    let mut small = a[i];
	    let mut pos = i;
	    for j in (i+1)..10
	    {
		if a[j]<small
		{
			small = a[j];
			pos=j;
		}
	}
		let mut temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	println!("\nprinting sorted elements...\n");
	for i in &a
	{
		println!("{}",i);
	}
} 

Output:

printing sorted elements...

7
9
10
12
23
23
34
44
78
101

JavaScript Program

<html>
<head>
<title> 
	Selection Sort 
</title> 
	</head>
	<body> 
	<script>
function smallest(a,  n, i)
{
	
	var small = a[i];
	var pos = i;
	for(j=i+1;j<10;j++)
	{
		if(a[j]<small)
		{
			small = a[j];
			pos=j;
		}
	}
	return pos;
}
var a = [10, 9, 7, 101, 23, 44, 12, 78, 34, 23];
	for(i=0;i<10;i++)
	{
		pos = smallest(a,10,i);
		temp = a[i];
		a[i]=a[pos];
		a[pos] = temp;
	}
	document.writeln("printing sorted elements ...\n"+"<br>");
	for(i=0;i<10;i++)
	{
		document.writeln(a[i]+"<br>");
	}
		</script>
	</body>
</html>

Output:

printing sorted elements ...
7
9
10
12
23
23
34
44
78
101

PHP Program

<html>
<head>
<title>Selection sort</title>
</head>
<body>
<?php
function smallest($a,  $n, $i)
{
	
	$small = $a[$i];
	$pos = $i;
	for($j=$i+1;$j<10;$j++)
	{
		if($a[$j]<$small)
		{
			$small = $a[$j];
			$pos=$j;
		}
	}
	return $pos;
}
$a = array(10, 9, 7, 101, 23, 44, 12, 78, 34, 23);
	for($i=0;$i<10;$i++)
	{
		$pos = smallest($a,10,$i);
		$temp = $a[$i];
		$a[$i]=$a[$pos];
		$a[$pos] = $temp;
	}
	echo "printing sorted elements ...\n";
	for($i=0;$i<10;$i++)
	{
		echo $a[$i];
		echo "\n";
	}
?>
</body>
</html>

Output:

printing sorted elements ...
7
9
10
12
23
23
34
44
78
101

Next TopicShell Sort

← prev next →

For Videos Join Our Youtube Channel: Join Now

Help Others, Please Share

Learn Latest Tutorials

PhoneGap

Gmail

Vue.js

PLC

Illustrator

Postman

IoT

GraphQL

Xampp

Kivy

A. Anywhere

Ext.js

Preparation

Aptitude

Reasoning

Verbal A.

Interview

Company

Trending Technologies

AWS

Selenium

Cloud

Hadoop

ReactJS

D. Science

Angular 7

Blockchain

Git

DevOps

B.Tech / MCA

DBMS

DAA

C. Network

Compiler D.

COA

D. Math.

E. Hacking

C. Graphics

Software E.

Web Tech.

Cyber Sec.

Automata

C++

Java

.Net

Python

Programs

Control S.

Data Mining

Javatpoint Services

JavaTpoint offers too many high quality services. Mail us on hr@javatpoint.com, to get more information about given services.

Website Designing
Website Development
Java Development
PHP Development
WordPress
Graphic Designing
Logo
Digital Marketing
On Page and Off Page SEO
PPC
Content Development
Corporate Training
Classroom and Online Training
Data Entry

Training For College Campus

JavaTpoint offers college campus training on Core Java, Advance Java, .Net, Android, Hadoop, PHP, Web Technology and Python. Please mail your requirement at hr@javatpoint.com.
Duration: 1 week to 2 week

^{Like/Subscribe us for latest updates or newsletter}

DS Tutorial

DS Array

DS Linked List

DS Stack

DS Queue

DS Tree

DS Graph

DS Searching

DS Sorting

Differences

Selection Sort

Example

Complexity

Algorithm

C Program

C++ Program

Java Program

C# Program

Python Program

Rust Program

JavaScript Program

PHP Program

Help Others, Please Share

Learn Latest Tutorials

Preparation

Trending Technologies

B.Tech / MCA

Javatpoint Services

Training For College Campus