Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- using namespace std;
- void wyswietl(int t[], int p, int k)
- {
- for (int i = p;i <= k;i++) cout << " " << t[i];
- cout << endl;
- }
- void sort_szybkie(int t[], int p, int k)
- {
- int i, j, wtemp, pivot;
- i = p; j = k;
- //pivot = t[i];
- //pivot = t[(p + k) / 2];
- //pivot = rand() % (p - k); error!!!!!!!!!!!!!!!!!
- cout << "pivot = " << pivot;
- while (i <= j)
- {
- while (t[i]<pivot) i++;
- while (t[j]>pivot) j--;
- if (i <= j)
- {
- wtemp = t[i];t[i] = t[j];t[j] = wtemp;
- i++; j--;
- }
- }
- cout << ", i=" << i << " j=" << j << endl;
- cout << "tab z poprzerzucanymi elementami:\n";
- wyswietl(t, p, k);
- cout << " podzial na podtablice: " << p << " - " << i - 1 << ", " << i << " - " << k << endl;
- if (p < j)
- {
- cout << "\nsort. lew. pol, el." << p << " - " << j << ":";
- wyswietl(t, p, j);
- sort_szybkie(t, p, j);
- }
- if (i < k)
- {
- cout << "sort. pr. pol., el." << i << " - " << k << ":";
- wyswietl(t, i, k);
- sort_szybkie(t, i, k);
- }
- {
- cout << " akt.stan podtab. " << p << " - " << k << ":";
- wyswietl(t, p, k);
- }
- if (p<j) sort_szybkie(t, p, j); //sortowanie lewej podtablicy
- if (i<k) sort_szybkie(t, i, k); //sortowanie prawej podtablicy
- }
- int main()
- {
- int tab1[] = { 44,32,74,51,46,71,49,73,86,34 };
- int tab2[] = { 1,2,3,4,5,6,7,8,9,10 };
- int tab3[] = { 10,9,8,7,6,5,4,3,2,1 };
- //sort_szybkie(tab1,4,9);
- //sort_szybkie(tab2,0,9);
- sort_szybkie(tab3, 0, 9);
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement