Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*void quickSort(int arr[], int left, int right) {
- int i = left, j = right;
- int tmp;
- int pivot = arr[(left + right) / 2];
- /* partition */
- /*while (i <= j) {
- while (arr[i] < pivot)
- i++;
- while (arr[j] > pivot)
- j--;
- if (i <= j) {
- tmp = arr[i];
- arr[i] = arr[j];
- arr[j] = tmp;
- //побутване
- i++;
- j--;
- }
- };
- /* recursion */
- /*if (left < j)
- quickSort(arr, left, j);
- if (i < right)
- quickSort(arr, i, right);
- }*/
- //etalon - стойността на мсива, която е в средата
- #include <iostream>
- using namespace std;
- void quick_sort(int[], int, int);
- int partition(int[], int, int);
- int main()
- {
- int a[50], n, i;
- cout << "How many elements?";
- cin >> n;
- cout << "\nEnter array elements:";
- for (i = 0; i<n; i++)
- cin >> a[i];
- quick_sort(a, 0, n - 1);
- cout << "\nArray after sorting:";
- for (i = 0; i<n; i++)
- cout << a[i] << " ";
- cout << endl;
- return 0;
- }
- void quick_sort(int a[], int l, int u)
- //не е рекурсивна функция
- {
- int j;
- if (l<u)
- {
- j = partition(a, l, u);
- quick_sort(a, l, j - 1);
- quick_sort(a, j + 1, u);
- }
- }
- int partition(int a[], int l, int u)
- {
- int v, i, j, temp;
- v = a[l];
- i = l;
- j = u + 1;
- do
- {
- do
- i++;
- while (a[i]<v&&i <= u);
- do
- //побутване
- j--;
- while (v<a[j]);
- if (i<j)
- {
- temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- //разменяме стойностите според условието
- } while (i<j);
- a[l] = a[j];
- a[j] = v;
- return(j);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement