1.选择排序
public static int[] selectionSort(int[] nums){
for (int i = 0; i < nums.length - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < nums.length; j++) {
if(nums[j] < nums[minIndex]){
minIndex = j;
}
}
swap(nums,i,minIndex);
}
return nums;
}
2.冒泡排序
public static int[] bubbleSort(int[] nums){
int length = nums.length;
for (int i = length - 1; i > 0 ; i--) {
for (int j = 0; j < i; j++) {