c#中选择排序和冒泡排序比较

//冒泡排序  冒泡排序需要双循环一个是趟数  一个是循环次数

int [] array  ={12,22,11,21,32,25,26,70};

int temp;

for(int i = 1; i<=8-1;i++){//注意是否越界

     for(int j =1; j<=8-i;i++){

        if(array[j-1]>array[j]){

                    temp = array[j-1];

                    array[j-1] = array[j];

                     array[j] = temp;

}

}

}

for(int i  = 1;i<=8;i++){

            Console.WriteLine(array[i]);

}

//选择排序

int [] array  ={12,22,11,21,32,25,26,70};

int min;//定义一个最小值

int minindex;//定义一个最小索引号

for(int i = 0; i<array.Length;i++){

              min = array[i] ;

              minindex = i;

              for(int j=1+i;j<array.Length-1;i++){

                              if(array[j]>min){

                               array[j] = min;                              

                               minindex = j;

                                                     }

                               }

                      array[minindex] =  array[i];

                      array[i] = min;

}

for(int i = 0;i<array.Length;i++){

Console.WriteLine(array[i]);}