基础-排序算法

1、选择排序

     int arrs[] = {2,33,22,66,1,70};
     int len = sizeof(arrs) / sizeof(arrs[0]);
     for(int i = 0;i < len - 1;i++){
          for(int j = i + 1;j < len;j++){
               if(arrs[i] > arrs[j]){
                    int temp = arrs[j];
                    arrs[j] = arrs[i];
                    arrs[i] = temp;
               }
          }
     }
     for(int i = 0;i < len;i++){
          printf("%d\t",arrs[i]);
     }

2、冒泡排序

     int arrs[] = {23,11,333,42,26,27,399,22,77,199,620,520,521,1314};
     int len = sizeof(arrs) / sizeof(arrs[0]);
     for(int i = 0;i < len;i++){
          printf("%5d",arrs[i]);
     }
     printf("\n");
     for(int i = 0;i < len - 1;i++){
          for(int j = 0;j < len - i -1; j++){
               if(arrs[j] > arrs[j+1]){
                    arrs[j] = arrs[j] ^ arrs[j+1];
                    arrs[j+1] = arrs[j] ^ arrs[j+1];
                    arrs[j] = arrs[j] ^ arrs[j+1];
               }
          }
     }
     for(int i = 0;i < len;i++){
          printf("%5d",arrs[i]);
     }