Selection Sorting

Sorting means to sort an array of data. Say you had an array of numbers [2,4,6,1,3,5] and you sorted it (in ascending order), you'd get [1,2,3,4,5,6].

There are many different types of sorting, refered to as sorting algorithms. You can find out about some of the primary ones (bubble, selection, insertion, merge).




 Selection Sorting in Ascending Manner

 #include<iostream.h>
 #include<conio.h>

 void main()

 {  clrscr();
 int i,j ,s,temp,p;
 int a[5]={5,9,3,7,1};

 cout<<"\n";
 cout<<"corginal array is: \n";
 for(i=0;i<5;i++)
  cout<<a[i];

 for(i=0;i<5;i++)
  {
    s=a[i];
    p=i;

    for(j=i;j<5;j++)
    {
    if(s>a[j])
    {
     s=a[j];
     p=j;
    }
    }
    temp=a[i];
    a[i]=a[p];
    a[p]=temp;
    }

    cout<<"\n";
 cout<<"sorted array is: \n";
 for(i=0;i<5;i++)
  cout<<a[i];
     getch();
    }

OUTPUT: