Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void sort_quick(int tab[], int d, int g) {
- if (d < g) {
- int t = tab[d];
- int s = d;
- for (int i = d + 1; i < g; i++) {
- if (tab[i] < t) {
- s = s + 1;
- std::swap(tab[s], tab[i]);
- }
- }
- std::swap(tab[d], tab[s]);
- sort_quick(tab, d, s - 1);
- sort_quick(tab, s + 1, g);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement