各种排序算法实例

冒泡排序: 

void BubbleSort(int* pData,int Count)
{
   int i,j;
   bool exchange = true;

   for (i=Count-1; i>0 && exchange; i--)
   {
      exchange = false;

      for (j=0; j<i; j++)
      {
          if (pData[j] > pData[j+1])
          {
              int tmp=pData[j];
              pData[j]=pData[j+1];
              pData[j+1]=tmp;
              exchange = true;
          }
      }
   }
}

 

/*  插入排序 */

void InsertSort(int *pData, int count)

{   

      int  i,j, tmp;

      for (i=1; i<count; i++)

      {  

            tmp=pData[i];

            for (j=1; j>=0 && tmp <pData[j]; j--)

            {

                  pData[j+1]=pData[j];

            }

            pData[j+1]=tmp;

}

 

/* 选择排序 */

void SelectSort(int *pData, int count)

{

      int i,j,k,tmp;

      for (i=0; i<count-1; i++)

      {  

             k = i;

            tmp=pData[i];

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

            {

                   if (tmp>pData[j])

                    {

                          k=j; 

                    }

            }

        

            if (k!=i)

            {

                      pData[i]=pData[k];

                      pData[k]=tmp;

            }

        }

}