Selection sort in C\C++ (Algorithm, Pseudocode and complexity)

Selection Sort

The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.

1) The subarray is already sorted.
2) Remaining subarray which is unsorted.

In every iteration of the selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.

This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.

This algorithm is not suitable for large data sets as its average and worst-case complexities are of Ο(n²), where n is the number of items.

How Selection Sort Works?

Consider the following depicted array as an example.

For the first position in the sorted list, the whole list is scanned sequentially. In the first position where 14 is stored presently, we search the whole list and find that 10 is the lowest value.

So we replace 14 with 10. After one iteration 10, which happens to be the minimum value in the list, appears in the first position of the sorted list.

For the second position, where 33 is residing, we start scanning the rest of the list in a linear manner.

We find that 14 is the second lowest value in the list and it should appear in second place. We swap these values.

After two iterations, the two least values are positioned at the beginning in a sorted manner.

The same process is applied to the rest of the items in the array.

Following is a pictorial depiction of the entire sorting process −

Now, let us learn some programming aspects of selection sort.

Algorithm

Step 1 − Set MIN to location 0
Step 2 − Search the minimum element in the list
Step 3 − Swap with value at location MIN
Step 4 − Increment MIN to point to next element
Step 5 − Repeat until list is sorted

Pseudocode

procedure selection sort 
   list  : array of items
   n     : size of list

   for i = 1 to n - 1
   /* set current element as minimum*/
      min = i    
  
      /* check the element to be minimum */

      for j = i+1 to n 
         if list[j] < list[min] then
            min = j;
         end if
      end for

      /* swap the minimum element with the current element*/
      if indexMin != i  then
         swap list[min] and list[i]
      end if
   end for
 
end procedure

Program for Selection Sort in C

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

#include int main() {     int i,j,n,loc,temp,min,a[30];     printf("Enter the number of elements:");     scanf("%d",&n);     printf("\nEnter the elements\n");     for(i=0;i<n;i++)     {         scanf("%d",&a[i]);     }     for(i=0;i<n-1;i++)     {         min=a[i];         loc=i;         for(j=i+1;j<n;j++)         {             if(min>a[j])             {                 min=a[j];                 loc=j;             }         }         temp=a[i];         a[i]=a[loc];         a[loc]=temp;     }     printf("\nSorted list is as follows\n");     for(i=0;i<n;i++)     {         printf("%d ",a[i]);     }     return 0; }

Program for Selection Sort in C++

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42

#include using namespace std; int main() {     int i,j,n,loc,temp,min,a[30];     cout<<"Enter the number of elements:";     cin>>n;     cout<<"\nEnter the elements\n";     for(i=0;i<n;i++)     {         cin>>a[i];     }     for(i=0;i<n-1;i++)     {         min=a[i];         loc=i;         for(j=i+1;j<n;j++)         {             if(min>a[j])             {                 min=a[j];                 loc=j;             }         }         temp=a[i];         a[i]=a[loc];         a[loc]=temp;     }     cout<<"\nSorted list is as follows\n";     for(i=0;i<n;i++)     {         cout<<a[i]<<" ";     }     return 0; }

Complexity for Selection Sort in C & C++

The time complexity for selection sort programs in C and C++ for both worst-case and average-case is O (n2) because the number of comparisons for both cases is the same.

So this is it guys if you want us to write more on this topic or have any particular query regarding this post you can always comment or feel free to mail us at our official mail also follow us on Instagram and Facebook to receive Latest Updates first.

PEACE!!!