[go: up one dir, main page]
Scribd
Upload
6 views3 pages

Selection Sort

Selection Sort is an algorithm that arranges elements in a list in ascending or descending order by repeatedly selecting the first element and swapping it with smaller elements in the list. The process involves comparing the selected element with all other elements and swapping when necessary until the list is sorted. The algorithm has a worst-case and average-case complexity of O(n^2).

Uploaded by

kothitarun130301
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
6 views3 pages

Selection Sort

Selection Sort is an algorithm that arranges elements in a list in ascending or descending order by repeatedly selecting the first element and swapping it with smaller elements in the list. The process involves comparing the selected element with all other elements and swapping when necessary until the list is sorted. The algorithm has a worst-case and average-case complexity of O(n^2).

Uploaded by

kothitarun130301
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Selection Sort

Selection Sort algorithm is used to arrange a list of elements in a particular order (Ascending or
Descending). In selection sort, the first element in the list is selected and it is compared
repeatedly with remaining all the elements in the list. If any element is smaller than the selected
element (for Ascending order), then both are swapped. Then we select the element at second
position in the list and it is compared with remaining all elements in the list. If any element is
smaller than the selected element, then both are swapped. This procedure is repeated till the
entire list is sorted.

Step by Step Process

The selection sort algorithm is performed using following steps...

 Step 1: Select the first element of the list (i.e., Element at first position in the list).
 Step 2: Compare the selected element with all other elements in the list.
 Step 3: For every comparision, if any element is smaller than selected element (for
Ascending order), then these two are swapped.
 Step 4: Repeat the same procedure with next position in the list till the entire list is
sorted.

Sorting Logic

Following is the sample code for selection sort...

//Selection sort logic

for(i=0; i<size; i++){


for(j=i+1; j<size; j++){
if(list[i] > list[j])
{
temp=list[i];
list[i]=list[j];
list[j]=temp;
}
}
}
Example
Complexity of the Insertion Sort Algorithm

To sort a unsorted list with 'n' number of elements we need to make ((n-1)+(n-2)+(n-3)+......+1)
= (n (n-1))/2 number of comparisions in the worst case. If the list already sorted, then it requires
'n' number of comparisions.

Worst Case : O(n2)


Best Case : Ω(n2)
Average Case : Θ(n2)

Selection Sort Program in C Programming


Language
#include<stdio.h>
#include<conio.h>

void main(){

int size,i,j,temp,list[100];
clrscr();

printf("Enter the size of the List: ");


scanf("%d",&size);

printf("Enter %d integer values: ",size);


for(i=0; i<size; i++)
scanf("%d",&list[i]);

//Selection sort logic

for(i=0; i<size; i++){


for(j=i+1; j<size; j++){
if(list[i] > list[j])
{
temp=list[i];
list[i]=list[j];
list[j]=temp;
}
}
}

printf("List after sorting is: ");


for(i=0; i<size; i++)
printf(" %d",list[i]);

getch();
}

You might also like