Selection Sort In Data Structure

  ⇰  SELECTION SORT :-

Selection sort is one of the simple type of sorting algorithm. This sorting algorithm is based on In-place comparision of element in the array. In this technique the smallest element is selected from the unsorted array and swapped with the leftmost element. This process continues moving unsorted array boundary by one element to the right. The selection starts from first element and searches the entire list or array until it finds the minimum value in the first place, again selects the second element and searches for the second samllest element. This process continues untill the complete list becomes sort form.This algorithm is not suitable for large data as insertion sort. Its  worst case complexity is Ο(n2), where n is the number of items.

FOR EXAMPLE :-

Let us take a unsorted list :-
     4 3 5 2 1

  ⇰  ALGORITHM OF SELECTION SORT :-

Variable used:-  array= list of element, size= number of element,
      I, J , temp = local variable.

Step1:- Initialize

           I=0

Step :- Repeat through step7 while (I < size -1)

Step3 :-  J= I +1

Step4 :- Repeat through step6 while  ( J < size )

Step5 :- If array [ I ] > array [J ] then,

            i> temp = array [I].

            ii> array [I] = array [J].

           iii> array[J] = temp.

Step6 :- J=J+1

Step7 :- I = I +1

Step8 :- Exit

  ⇰  PROGRAM OF SELECTION SORT IN 'C' :-

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

void main()

{

    int  i, j, temp, no[5];

 printf("Enter Values of array for sorting:- ");

for (i = 0 ; i < 5 ; i++)

{

  scanf ( " %d " ,& no[i] );

}

for (i = 0 ; i < 5-1 ; i++)

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

 }

printf(" \n Sorted value :- ");

for ( i=0 ; i < 5; i++)

 {

    printf(" \n %d" , no[i] );

}

getch();

}

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.