c#冒泡排序

冒泡排序法:但是 没有标识 不是最佳算法 

int[]arr=new int[]{9,1,10,5,3,2,88,6};
   int temp = 0;

One.
for(int i=0;i<arr.length;i++){
          for(int j=0;j<arr.length-i-1;j++){
                    if(arr[j]>arr[j+1]){
                            temp = arr[j];
                           arr[j] = arr[j+1];
                           arr[j+1] = temp;
                   }
          }
}

Two.
for(int i=0;i<arr.length - 1;i++){
           for(int j=i+1;j<arr.length;j++){
                    if(arr[i]>arr[j]){
                         temp = arr[i];
                          arr[i] = arr[j];
                          arr[j] = temp;
                    }
           }
}

Three.
for(int i=0;i<=arr.length-2;i++){
           for(int j=arr.length-1;j>=1;j--){
                    if(arr[j]<arr[j-1]){
                           temp = arr[j];
                           arr[j] = arr[j-1];
                           arr[j-1] = temp;
                    }
          }
}

for(int k=0;k<arr.length;k++){
    System.out.println(arr[k]);
}

 

.net 新增arr.sort方法

转载于:https://www.cnblogs.com/eastday/archive/2010/03/10/1682689.html