Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_DEPRECATE
- #include <iostream>
- #include <vector>
- #include <string>
- #include <map>
- #include <set>
- #include <algorithm>
- #define li long long
- using namespace std;
- int a[1000001];
- void quickSortR(int *a, int n) {
- int i = 0, j = n;
- int t, temp;
- int p = a[n / 2];
- do {
- while (a[i] < p) i++;
- while (a[j] > p) j--;
- if (i <= j) {
- swap(a[i], a[j]);
- i++; j--;
- }
- } while (i <= j);
- if (j > 0) quickSortR(a, j);
- if (n > i) quickSortR(a + i, n - i);
- }
- int main() {
- int n;
- cin >> n;
- for (int i = 0; i < n; i++) {
- cin >> a[i];
- }
- quickSortR(a, n - 1);
- for (int i = 0; i < n; i++) {
- cout << a[i] << ' ';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement