Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- void quickSort(int tablou[], int prim, int ultim)
- {
- int temp, min, max, separator_lista;
- min = prim;
- max = ultim;
- separator_lista = tablou[(prim + ultim) / 2];
- do
- {
- while (tablou[min] < separator_lista) min++;
- while (tablou[max] > separator_lista) max--;
- if (min <= max)
- {
- temp = tablou[min];
- tablou[min++] = tablou[max];
- tablou[max--] = temp;
- }
- } while (min <= max);
- if (prim < max) quickSort(tablou, prim, max);
- if (min < ultim) quickSort(tablou, min, ultim);
- }
- void main()
- {
- int val[100], i;
- for (i = 0; i < 100; i++)
- val[i] = rand() % 200;
- quickSort(val, 0, 99);
- for (i = 0; i < 100; i++)
- std::cout << val[i] << " ";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement