selection sort.c

来自「selection sort is a sorting algorithm us」· C语言 代码 · 共 48 行

#include<stdio.h>
#include<conio.h>

int minimum(int *a ,int i ,int j)
{
    int k,min = i;
    for(k=i+1;k<=j;k++)
         if(a[min]> a[k])
              min = k;
    return min;
}

void sSort(int *a , int n)                  //selection sort
{
     int i,j,min;
     for(i = 0;i<n-1;i++)
     {     
           min = minimum(a , i+1 , n-1);
               if(a[i] > a[min])
                    a[i] ^=a[min] ^= a[i] ^=a[min];
     }

}
int main()
{
    
     int *a;
     int i,n;
     printf("\nenter no of elements to sort (using insertion sort) : ");
     scanf("%d",&n); 
     a=(int *)malloc(n*sizeof(int));
     printf("\n\nEnter the values to sort : \n");
     for(i=0;i<n;i++)
            scanf("%d",&a[i]);         
     printf("\nBefore sorting : ");
     for(i=0;i<n;i++)
          printf(" %d ",a[i]);

     sSort(a , n);

     printf("\n\nAfter sorting : \n");
     for(i=0;i<n;i++)
         printf(" %d ",a[i]);
         
     getch();
     return 0;
}