冒泡排序
public static int[]bubbleSort(int[] arr){
int temp = 0;
for(int i = 0;i<arr.length-1;i++){
for(int j = 0;j<arr.length-1-i;j++){
if(arr[j] > arr[j+1]){
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
选择排序
public static int[] selectSort(int[] arr){
int temp = 0;
for(int i = 0;i<arr.length-1;i++)
for(int j = i;j<arr.length-1;j++)
if(arr[i]>arr[j+1]){
temp = arr[i];
arr[i] = arr[j+1];
arr[j+1] = temp;
}
return arr;
}