Copyright © Programs ++
Design by Dzignine
Monday, 27 February 2012

Selection sort in C++

One family of internal sorting algorithms is selection sort. The basic idea of selection sort is to repeatedly select the smallest key in the remaining unsorted array. Simply put, an element is taken as the smallest key element
and then it is compared with the other elements to sort the array.  It is implemented in the form of exchange selection sort that requires a single array to work with. In this technique, computer keeps on finding the next smallest element and brings it at its appropriate positions.
Selection sort can be used to sort an array in both ascending as well as descending order. The following program demonstrates
the implementation of selection sort in ascending order :

// Program to implement selection sort in C++ ( ascending order )

#include <iostream>

void selectionSort(int AR[],int size)
     int i,j,temp;
     for (i=0; i<size; i++)
          for (j=i+1; j<=size; j++)
               if ( AR[i] > AR[j] ) // sorts in ascending order
                    temp = AR[j];
                    AR[j] = AR[i];
                    AR[i] = temp;
          } // end of sub loop
     } // end of main loop

} // end of function selectionSort

int main()
     int arr[20],size;
     // prompts the user to enter the elements in the array
     std::cout<<" Enter the no. of elements that you want to enter (max 20 ) : ";
     std::cout<<" Now enter the elements in the array ";
     for (int i=0; i<size; i++)
          std::cout<<" \n Element "<<i<<" : ";
     selectionSort(arr,size); // calls the function to sort the array
     std::cout<<" \n The sorted array is as follows ";
     for (int i=0; i<size; i++)
          std::cout<<" \n Element "<<i<<" : "<<arr[i];
     return 0;
} // end of main

------ OUTPUT ------

Please do comment if you don't understand any part or want to know more or just want to say thanks. I love programming and love to teach my friends. Your suggestions and appreciation will make this blog much better.

------ Related Posts ------
Bubble Sort in C++ :
Insertion Sort in C++ :


  1. I have some web hits. - - [05/Mar/2011:08:38:43 +0000] "GET /honelink/jsp/index.jsp HTTP/1.1" 200 13839 "CLIENT-IP=-" "-" - [05/Mar/2011:08:39:33 +0000] "GET /publications/servlet/pbi.wss?CTY=US&FNC=PBL&PBL=SG24-7833-00 HTTP/1.1" 200 24916 "CLIENT-IP=-" "Mozilla/4.0 (compatible; MSIE 8.0; Windows NT 5.1; Trident/4.0; .NET CLR 1.1.4322; .NET CLR 2.0.50727; .NET CLR 3.0.4506.2152; .NET CLR 3.5.30729)"

    In this way i have many web hits i would like to sort these web hits using Ip address.Could u please help me out in this

  2. Well Kalyan, you see the problem with sorting IP addresses is that, they can vary by a high degree, e.g. one hit can be from and another can be from So i suggest you GOOGLE a bit, here are a few links to get point you in the right direction :

  3. you have made the pgming techniques simpler thank u :):):)

  4. sir it is good but it will be more understandable if you summarize the source code under the program to learners like me

  5. if i want to add the descending how?

  6. this has a flaw.. If the size of the array is 5. it means you can only index from 0 to 4. but in the code it tries to retrieve AR[5] which will give you a funny number already stored in the memory.

  7. wen i try diz its not running .

  8. this is bubble sort...not selection sort..

  9. Insertion Sort in C

    Insertion Sort is a simplest array data or data Sorting algorithm which sorts the array elements by shifting elements one by one and inserting each element into its proper position.


Comment Here....