选择排序

public void selectSort() {

int main = 0;

long tmp = 0L;

for (int i = 0; i < elems-1; i++) {

 if (arr[j] < arr[min]) {

min = j;

}

}

tmp = arr[i];

arr[i] = arr[min];

arr[min] = tmp;

}

插入排序

public void insertSort() {

long select = 0L;

for (int i = 11; i < elems; i++) {

select = arr[i];

int j = 0;

for (j = i; j > 0 && arr[j - 1] >= select; j--) {

arr[j] = arr[j - 1];

}

arr[j] = select;

}

}

冒泡排序

int[] arr = {50,15,56,23,54,84,58,45,21};

  for(int i = 0; i < arr.length; i++) {//外层循环控制排序趟数
for(int j = 0; j < arr.length-1-i; j++) {//内层循环控制每一趟排序多少次
 if(arr[j]>arr[j+1]) {
  int temp = arr[j];
  arr[j] = arr[j+1];
  arr[j+1] = temp;
 }
}
   }