算法代码

冒泡

int arr[]={1,5,6,8,3};
 for(int i=0;i<arr.length;i++){
     for (int j=0;j<arr.length-1;j++){
         if(arr[j]>arr[j+1]){
             int temp;
             temp=arr[j];
             arr[j]=arr[j+1];
             arr[j+1]=temp;
         }
     }
 }

 for(int i=0;i<arr.length;i++){
      Log.d("ddd",""+arr[i]);
 }


选择

int arr[]={5,8,6,3,2,1};
 int min;
 int temp=0;
 for (int i=0;i<arr.length;i++){
     min=arr[i];
     for(int j=i;j<arr.length;j++){
         if(arr[i]>min){
             min=arr[i];
             temp=arr[i];
             arr[i]=min;
             arr[j]=temp;
         }
     }
 }

 for (int i=0;i<arr.length;i++){
     Log.d("ddd",""+arr[i]);
 }

猜你喜欢

转载自blog.csdn.net/qq_40983361/article/details/80102506