选择排序

1.选择排序：

时间复杂度：O(n^2)

空间复杂度：O(1)

2.Java代码：

public static void main(String[] args) {
int[] arr = {1, 23, 453, 12, 13, 46, 87, 78, 23, 21};
int[] res = xuanze(arr);
print(res);
}

private static int[] xuanze(int[] arr) {
int length = arr.length;
for (int i = 1; i < length; i++) {
int tmp;
for (int j = i + 1; j < length; j++) {
if (arr[i] > arr[j]) {
tmp = arr[j];
arr[j] = arr[i];
arr[i] = tmp;
}
}
}
return arr;
}

private static void print(int[] arr) {
int length = arr.length;
for (int i = 0; i < length; i++) {
System.out.println(arr[i]);
}
}