Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <ctime>
- #include <cstdlib>
- #include <algorithm>
- int t[31];
- void qsort(int l, int p) {
- int m = l;
- for (int i = l+1; i <= p; ++i) {
- if(t[i] <= t[l])
- std::swap(t[++m], t[i]);
- }
- std::swap(t[l], t[m]);
- if (m - l > 1) qsort(l, m-1);
- if (p - m > 1) qsort(m+1, p);
- }
- int main() {
- srand(time(NULL));
- for (int i = 0; i < 30; ++i) {
- int r = rand()%99 + 10;
- t[i] = r;
- std::cout << t[i] << ' ';;
- }
- std::random_shuffle(t, t+29);
- qsort(0, 29);
- std::cout << '\n';
- for (int i = 0; i < 30; ++i)
- std::cout << t[i] << ' ';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement