Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "pch.h"
- #include <iostream>
- #include <windows.h>
- #include <cstdlib>
- #include <ctime>
- using namespace std;
- void sort_quick(int tab[], int zero, int elementy)
- {
- int srodek = tab[zero + elementy / 2];
- int i, j, temp;
- i = zero;
- j = elementy;
- do
- {
- while (tab[j] > srodek)
- j--;
- while (tab[i] < srodek)
- i++;
- if (i <= j)
- {
- temp = tab[i];
- tab[i] = tab[j];
- tab[j] = temp;
- i++;
- j--;
- }
- }while (i <= j);
- if (j > zero) sort_quick(tab, zero, j);
- if (i < elementy) sort_quick(tab, i, elementy);
- }
- void losowanie(int tab[], int n)
- {
- cout << "\nTablica = { ";
- for (int i = 0; i < n; i++)
- {
- tab[i] = (rand() % 100) + 0;
- cout << tab[i] << ", ";
- }
- cout << "}\n\n";
- }
- void po_posortowaniu(int tab[], int elementy)
- {
- cout << "Tablica po posortowaniu = { ";
- for (int i = 0; i < elementy; i++)
- {
- cout << tab[i] << ", ";
- }
- cout << "}" << endl;
- }
- int main()
- {
- srand(time(NULL));
- int elementy;
- cout << "Podaj liczbe elementow tablicy: ";
- cin >> elementy;
- int *tab = new int[elementy];
- losowanie(tab, elementy);
- DWORD start = GetTickCount();
- sort_quick(tab, 0, elementy-1);
- po_posortowaniu(tab, elementy);
- printf("Czas wykonywania: %lu ms\n", GetTickCount() - start);
- delete[] tab;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement