Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- static void QuickSort(int[] tab, int p, int l)
- {
- var n = tab[(l + p) / 2];
- int i, j, x;
- i = l;
- j = p;
- do
- {
- while (tab[i] < n) i++;
- while (tab[j] > n) i--;
- if (i <= j)
- {
- x = tab[i];
- tab[i] = tab[j];
- i++;
- j--;
- }
- } while (i <= j);
- if (j>l) QuickSort(tab,l,j);
- if(i<p) QuickSort(tab,i,p);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement