冒泡排序
时间复杂度:O(n^2)
public static int[] bubbleSort(int[] arr){
for (int i = 0; i < arr.length-1; i++) {
int temp = 0;
for(int j = i+1;j<arr.length;j++){
if(arr[i]>arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
return arr;
}
选择排序
时间复杂度:O(n^2)
public static int[] selectSort(int[] arr){
for (int i = 0; i < arr.length-1; i++) {
int temp = arr[i];
int index = i;
for (int j = i+1; j < arr.length; j++) {
if(arr[j]<temp){
temp = arr[j];
index = j;
}
}
arr[index] = arr[i];
arr[i] = temp;
}
return arr;
}
插入排序
时间复杂度:O(n^2)
public static int[] insertSort(int[] arr){
int index;
for (int i = 1; i < arr.length; i++) {
int temp = arr[i];
index = i;
while (index > 0 && arr[index-1]>=temp){
arr[index] = arr[index-1];
--index;
}
arr[index] = temp;
}
return arr;
}