Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void quicksort(int *tab, int p, int k)
- {
- int pivot, i = p, j = p;
- pivot = (p + k) / 2;
- swap(tab, k, pivot);
- while (i < k)
- {
- if (tab[i] < tab[k])
- swap(tab, i, j++);
- i++;
- }
- swap(tab, j, k);
- if(p < j - 1)quicksort(tab, p, j - 1);
- if(j + 1 < k)quicksort(tab, j + 1, k);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement