冒泡，希尔排序

 冒泡排序

int temp = 0;

for (int i = 0; (i < length && temp); i++)

{

       temp = 0;

       for (int j = i; j< length; j++)

       {

              if (a[i] < a[j])

              {

                     change;

                     if (temp == 0)

                            temp = 1;

              }

       }

}

                                   希尔排序

 

主要思想是把待排数据不停的分组,然后不停对每一组数据排序

D = n;

do  

       {

              d>>=1;

              for (i = 0; i < 10; i+= d)

              {

                     for (j = 0; j < 10; j += d)

                     {

                            if (Sort[i] > Sort[j])

                            {

                                   Sort[i] = Sort[i] + Sort[j];

                                   Sort[j] = Sort[i] - Sort[j];

                                   Sort[i] = Sort[i] - Sort[j];

                            }

                     } //这2个for就是对一组数据进行排序

              }

       }while(d > 1);