Selection Sort

This is an example C of program which demonstrates a type of sorting of an array known as SELECTION SORT.  We have provided input/output screenshots at the end of the code.

You can compile this program on bOtskOOl Free Online C/C++ Compiler

 

SOURCE CODE 

//SELECTION SORT

 /*

**********************

www.botskool.com

**********************

*/

#include <iostream>

using namespace std;

int main()

{

      int i,j,loc,low,ar[5],temp;

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

      {

           printf("\nEnter the no. %d element ",i);

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

      }


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


      {

            low=ar[i];

            loc=i;


            for(j=i+1;j<5;j++)

            {

                  if(ar[j]<low)

                  {


                       low=ar[j];

                        loc=j;

                  }

            }


            temp=ar[loc];

            ar[loc]=ar[i];

          ar[i]=temp;

      }

      printf("\nThe elements in Ascending Order are \n");

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

      printf("%d ",ar[j]);

}

The above OUTPUT was generated by bOtskOOl Online Compiler try>>

Download Source Code

 

Terms of Agreement:  
By using this code, you agree to the following terms-  
1) You may use this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge.  
2) You MAY NOT redistribute this code (for example to a web site) without written permission from us. Failure to do so is a violation of copyright laws.  
3) You may link to this code from another website, but ONLY if it is not wrapped in a frame.
4) You will abide by any additional copyright restrictions which may have placed in the code or code's description.

 >>Kindly post your doubts and suggestions on our discussion forum.

Tags: