fork download
  1.  
  2. #include <iostream>
  3. using namespace std;
  4. void swap1(int tab[], int zamiana1, int zamiana2)
  5. {
  6. int temp = tab[zamiana1];
  7. tab[zamiana1] = tab[zamiana2];
  8. tab[zamiana2] = temp;
  9. }
  10. void qSort(int tab[],int left, int right)
  11. {
  12. if (left < right)
  13. {
  14. int m = left;
  15. for (int i = left+1; i < right; i++)
  16. if (tab[left] > tab[i])
  17. {
  18. m++;
  19. swap1(tab, i, m);
  20. }
  21. swap1(tab, m, left);
  22.  
  23. qSort(tab, left, m - 1);
  24. qSort(tab, m + 1, right);
  25. }
  26. }
  27.  
  28.  
  29. int main()
  30. {
  31. int tab[] = { 4,3,5,2,5,6,5,2,3,5,3,2,234,21,1,35,13,2,3,45 };
  32. qSort(tab, 0,20);
  33. for (int i = 0; i < 20; i++)
  34. cout << tab[i] << endl;
  35. return 0;
  36. }
  37.  
  38.  
  39.  
Success #stdin #stdout 0s 16064KB
stdin
Standard input is empty
stdout
1
2
2
2
3
3
3
3
2
4
5
5
5
5
6
21
13
35
45
234