Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- //#include <algorithm>
- using namespace std;
- const int N = 15;
- void quickSort(int array[], int start, int end) {
- if (start < end) {
- int l = start+1, r = end, p = array[start];
- while (l < r) {
- if(array[l] <= p)
- l++;
- else if(array[r] >= p)
- r--;
- else
- swap(array[l], array[r]);
- }
- if (array[l] < p) {
- swap(array[l], array[start]);
- l--;
- }
- else {
- l--;
- swap(array[l], array[start]);
- }
- quickSort(array, start, l);
- quickSort(array, r, end);
- }
- }
- int main(int argc, const char * argv[]) {
- int i, tab[N];
- srand(time(0));
- cout << "Wylosowane liczby:\n";
- for (i = 0; i < N; i++) {
- tab[i] = rand() % 31 + 1;
- cout << tab[i] << ' ';
- }
- cout << endl << endl;
- quickSort(tab, 0, N-1);
- for (i = 0; i < N; i++) {
- cout << tab[i] << ' ';
- }
- cout << endl << endl;
- //system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement