Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- private void QuickSort(int[] tab, int lewa, int prawa)
- {
- if (tab == null)
- {
- return;
- }
- int i = lewa;
- int j = prawa;
- int podzial = tab[(lewa + prawa) / 2];
- while (i <=j)
- {
- while (tab[i] < podzial)
- {
- i++;
- }
- while (tab[j] > podzial)
- {
- j--;
- }
- if (i <= j)
- {
- int tmp = tab[i];
- tab[i++] = tab[j];
- tab[j--] = tmp;
- }
- }
- if (j > 0)
- {
- QuickSort(tab, lewa, j);
- }
- if (i<prawa)
- {
- QuickSort(tab, i, prawa);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement