Advertisement
l_Jocker_l

Untitled

Oct 15th, 2019
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.17 KB | None | 0 0
  1. #include<iostream>
  2. #include<string>
  3. #include<fstream>
  4. #include<cmath>
  5. using namespace std;
  6. int main() {
  7.  
  8.  
  9. const size_t size = 6;
  10. int mas[6];
  11. for (int i = 0; i < size; i++) {
  12. cout << "Enter " << i << " element of massif : " << endl;
  13. cin >> mas[i];
  14. cout << endl;
  15. }
  16. int reload = 0;
  17.  
  18.  
  19. for (unsigned i = 0; i < size ; ++i) {
  20. for (unsigned k = 0; k < size - i -1; ++k) {
  21. if (mas[k] > mas[k + 1]) {
  22.  
  23. reload = mas[k + 1];
  24. mas[k + 1] = mas[k];
  25. mas[k] = reload;
  26.  
  27. }
  28. }
  29. }
  30. cout << "Ordered massif :" << endl;
  31. for (unsigned i = 0; i < size; ++i)
  32. cout << mas[i] << " ";
  33. cout << endl;
  34.  
  35. cout << "--------------------------------------------------------" << endl;
  36.  
  37.  
  38. const size_t index = 6;
  39. int indexArr[size] = {0,1,2,3,4,5};
  40. int inArr=0;
  41. for (unsigned i = 0; i < size; ++i) {
  42. for (unsigned k = 0; k < size - i - 1; ++k) {
  43. if (mas[k] > mas[k + 1]) {
  44. inArr=indexArr[k + 1];
  45. indexArr[k + 1] = indexArr[k];
  46. indexArr[k] = inArr;
  47. reload = mas[k + 1];
  48. mas[k + 1] = mas[k];
  49. mas[k] = reload;
  50.  
  51. }
  52. }
  53. }
  54. for (unsigned i = 0; i < size; ++i)
  55. cout << indexArr[i];
  56.  
  57.  
  58. cin.get();
  59. return 0;
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement