Search Your Topic

Tuesday, 27 June 2017 11:33

Selection Sorting

Written by
Rate this item
(0 votes)

Selection sorting is conceptually the most simplest sorting algorithm. This algorithm first finds the smallest element in the array and exchanges it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continues in this way until the entire array is sorted.

How Selection Sorting Works

Selection Sorting in Data Structures

In the first pass, the smallest element found is 1, so it is placed at the first position, then leaving first element, smallest element is searched from the rest of the elements, 3 is the smallest, so it is then placed at the second position. Then we leave 1 nad 3, from the rest of the elements, we search for the smallest and put it at third position and keep doing this, until array is sorted.

Sorting using Selection Sort Algorithm

void selectionSort(int a[], int size)
  int i, j, min, temp;
  for(i=0; i < size-1; i++ )
    min = i;   //setting min as i
    for(j=i+1; j < size; j++)
      if(a[j] < a[min])   //if element at j is less than element at min position
       min = j;    //then set min as j
   temp = a[i];
   a[i] = a[min];
   a[min] = temp;

Complexity Analysis of Selection Sorting

Worst Case Time Complexity : O(n2)
Best Case Time Complexity : O(n2)
Average Time Complexity : O(n2)
Space Complexity : O(1)


Read 2225 times
Anish Sir

"I am delighted once again to pen the welcome note to the Tosh!Yas Technologies ."

 Call +91 74 88 34 7779  | Email :

Leave a comment

Make sure you enter all the required information, indicated by an asterisk (*). HTML code is not allowed.