题目描述
blablabla
样例
import java.util.Scanner;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] nums = new int[n];
int i = 0;
while (scanner.hasNext()) {
nums[i++] = scanner.nextInt();
}
quickSort(0, n - 1, nums);
for (i = 0; i < n; i++) {
System.out.printf("%d ", nums[i]);
}
// System.out.println(Arrays.toString(nums));
}
public static void quickSort(int left, int right, int[] nums) {
// if (left >= right)
// return;
// // System.out.printf("%d, %d\n", left, right);
// int l = left - 1, r = right + 1;
// int mid = (left + right) >> 1;
// int tmp = nums[mid];
// while (l < r) {
// while (nums[++l] < tmp);
// while (nums[--r] > tmp);
// if (l < r) {
// int a = nums[l];
// nums[l] = nums[r];
// nums[r] = a;
// }
// }
// quickSort(left, r, nums);
// quickSort(r + 1, right, nums);
}
}
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla