Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma once
- #include <iostream>
- #include <vector>
- using namespace std;
- void swap(vector<int> &v, int x, int y) {
- int temp = v[x];
- v[x] = v[y];
- v[y] = temp;
- }
- void quicksort(vector<int>& vec, int L, int R) {
- int i, j, mid, piv;
- i = L;
- j = R;
- mid = L + (R - L) / 2;
- piv = vec[mid];
- while (i<R || j>L) {
- while (vec[i] < piv)
- i++;
- while (vec[j] > piv)
- j--;
- if (i <= j) {
- swap(vec, i, j);
- i++;
- j--;
- }
- else {
- if (i < R)
- quicksort(vec, i, R);
- if (j > L)
- quicksort(vec, L, j);
- return;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement