fork download
  1. #include <iostream>
  2. #include <vector>
  3. using namespace std;
  4. void bubble_sort(vector<int> &v){
  5. bool unordered = v.size() > 1; //flaga
  6. while (unordered) {
  7.  
  8. unordered = false;
  9. for (int i = 0; i +1< v.size(); ++i){
  10. if (v[i] > v[i+1]){
  11. swap(v[i], v[i+1]);
  12.  
  13. unordered = true;
  14.  
  15. }
  16. }
  17.  
  18. for(int i =0; i < v.size(); ++i) {
  19. cout << v[i] << " ";
  20. }
  21. cout<<endl;
  22.  
  23.  
  24. }
  25. }
  26. int main()
  27. {
  28. vector<int> v;
  29. // for (int n; cin >> n;){
  30. //1 9 2 3 4 1 6 6 5 3 8
  31. v.push_back(1); v.push_back(9); v.push_back(2);
  32. v.push_back(3); v.push_back(4); v.push_back(1);
  33. v.push_back(6); v.push_back(6); v.push_back(5);
  34. v.push_back(3); v.push_back(8);
  35. // }
  36. //funkcja co sortuje wketor
  37. bubble_sort(v);
  38. //koniec f
  39. for (int i = 0; i < v.size(); ++i){
  40. cout << v[i] << " ";
  41. }
  42.  
  43. }
  44.  
  45. //1 9 2 3 4 1 6 6 5 3 8
  46.  
Success #stdin #stdout 0s 4408KB
stdin
1 9 2 3 4 1 6 6 5 3 8
stdout
1 2 3 4 1 6 6 5 3 8 9 
1 2 3 1 4 6 5 3 6 8 9 
1 2 1 3 4 5 3 6 6 8 9 
1 1 2 3 4 3 5 6 6 8 9 
1 1 2 3 3 4 5 6 6 8 9 
1 1 2 3 3 4 5 6 6 8 9 
1 1 2 3 3 4 5 6 6 8 9