Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void QuickSort(int arr[], int l, int r)
- {
- int i, j, x = arr[(l + r) / 2]; //x la phan tu pivot
- i = l;
- j = r;
- do
- {
- while (arr[i] > x) i++;
- while (arr[j] < x) j--;
- if (i <= j) {
- swap(arr[i], arr[j]);
- i++;
- j--;
- }
- } while (i < j);
- if (l < j)
- QuickSort(arr, l, j);
- if (i < r)
- QuickSort(arr, i, r);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement