Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void quicksort(int lewy, int prawy) {
- int v = tablica[(lewy + prawy) / 2];
- int i, j, x;
- i = lewy;
- j = prawy;
- do {
- while (tablica[i] < v) {
- i++;
- }
- while (tablica[j] > v) {
- j--;
- }
- if (i <= j) {
- x = tablica[i];
- tablica[i] = tablica[j];
- tablica[j] = x;
- i++;
- j--;
- }
- } while (i <= j);
- if (j > lewy) {
- quicksort(lewy, j);
- }
- if (i < prawy) {
- quicksort(i, prawy);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement