对同一列数据用各种排序法来统计分别各自交换了多少次，来比较用哪种方法交换的次数最少？

# include "stdio.h"
# define N 10
int main()
{
    int i,j,temp,count,z;
    int a[N]={10,9,8,7,6,5,4,3,2,1};
    printf("这段代码是用选择排序法来统计共交换了多少次。\n ");
    printf("交换前的数据： ");
    for(i=0;i<N;i++)
              printf(" %4d",a[i]);
    printf("\n");
    for(i=0;i<N;i++)
    for(j=i+1;j<N;j++)
    {
        if (a[i]>a[j])
        {
        temp=a[i];
        a[i]=a[j];
        a[j]=temp;
        printf(" 第 %3d 次交换: ",++count);
        for(z=0;z<N;z++)
              printf("%4d ",a[z]);
         printf("\n");
        }
    }
    printf("共交换%4d 次",count);
    printf("\n");
    printf(" 交换后的数据： ");
    for(i=0;i<N;i++)
    printf("%5d",a[i]);
}

#include<stdio.h>
#include<malloc.h>
void InsertSorting(int a[],int len)
{   int count=0;
    for(int i=1;i<len;i++)
    {
        int k=i,z;
        int temp=a[k];
        for(int j=i-1;(j>=0)&&(a[j]>temp);j--)
        {
            a[j+1]=a[j];
            k=j;
        a[k]=temp;
        printf(" 第 %3d 次交换: ",++count);
        for(z=0;z<10;z++)
              printf("%4d ",a[z]);
         printf("\n");
         }
        
    }
    printf("共交换%4d 次",count);
}
int main(int argc, char *argv[])
{
   int a[10]={10,9,8,7,6,5,4,3,2,1};
   int i=0;
   printf("这段代码是用插入排序法来统计共交换了多少次。\n ");
   printf("交换前的数据： ");
    for(i=0;i<10;i++)
              printf(" %4d",a[i]);
    printf("\n");
   InsertSorting(a,10);
   printf(" 交换后的数据： ");
   for(i=0;i<10;i++)
             printf("%3d ",a[i]);
  return 0;
}

#include <stdio.h>

 void sort(int *a,int len)

 {
   int i,j,t,z,count=0;
   for(i=0;i<len-1;i++)  
     {
         int mask=1;
       for(j=0;j<len-i-1;j++)
          {
           if(a[j]>a[j+1])
              {
                  mask=0;
                t=a[j];
                a[j]=a[j+1];
                a[j+1]=t;
                printf(" 第 %3d 次交换: ",++count);
                for(z=0;z<10;z++)
                   printf("%4d ",a[z]);
                printf("\n");
             }
          }
          if(mask)
             break;
    }
    printf("共交换%4d 次",count);
      printf("\n");
  }
int main(int argc, char *argv[])
{
   int a[10]={10,9,8,7,6,5,4,3,2,1};
   int i=0;
   //sort(a,10);
   printf("这段代码是用冒泡排序法来统计共交换了多少次。\n ");
    printf("交换前的数据： ");
   for(i=0;i<10;i++)
              printf(" %4d",a[i]);
   printf("\n");
   sort(a,10);
   printf(" 交换后的数据： ");
   for(i=0;i<10;i++)
             printf("%4d ",a[i]);
   return 0;
}

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
typedef int E_T;

void sort( E_T *array, int l, int r );

int main( void )
{
    E_T a[ 10 ] = {9,9,2,3,4,5,6,7,0,0};
  /*  srand( ( unsigned long )time( NULL ) );
   
    for( int i = 0; i < 10; ++i )
    {
        a[ i ] = rand() % 1000;
        printf( "%d ",a[ i ] );
    }*/
    printf( "\n" );
    sort( a, 0, 10 );
    for( int i = 0; i < 10; ++i )
        printf( "%d ", a[ i ] );
    return 0;
}


void sort( E_T *array, int l, int r )
{
    int minix, maxix;
    int R;
    int c;
    int f;
    int s;
   
    s = 0;
   
    if( l >= r )
        return;
   
   
    for( int ix = l; ix < r -1; ix++ )
    {
        if( array[ ix ] <= array[ ix + 1 ] )
            s++;
        else if( array[ ix ] > array[ix + 1 ] )
        {
            s--;
            if( s > 0 )
                break;
        }
        else
            break;
    }
   
    c=0;
   
    if( s == r - l - 1 )
    {
         printf("jiao huan %d ci\n",c);
        return;
    }
    else if( s == l - r + 1)
    {
        for(r -= 1 ; l < r; l++,r-- )
        {
            c++;
            E_T temp = array[ l ];
            array[ l ] = array[ r ];
            array[ r ] = temp;
        }
    }
    else
    {
        for( ; l < r; ++l, --r )
        {
             f = 0;
            for( minix = l + 1, maxix = r - 2, R = r - 1; minix <= R; ++minix, --maxix )
            {
                if( array[ l ] > array[ minix ] )
                {
                    c++;
                    f = 1;
                    E_T temp = array[ l ];
                    array[ l ] = array[ minix ];
                    array[ minix ] = temp;
                }
                if( array[ R ] < array[ maxix ] )
                {
                    c++;
                    f = 1;
                    E_T temp = array[ R ];
                    array[ R ] = array[ maxix ];
                    array[ maxix ] = temp;
                }
            }
            
            if( f != 0 )
                sort( array, l + 1, r - 1 );
        }
    }
   
    printf("jiao huan %d ci\n",c);
   
}