Advertisement
avr39ripe

BR012arrBasics

Feb 17th, 2021
138
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.27 KB | None | 0 0
  1. #include <iostream>
  2. #include <chrono>
  3.  
  4. //(?)(1)(2)(3)(4)(5)(?)()()()(?)
  5. //[-1][0][1][2][3][4][10]
  6.  
  7. int main()
  8. {
  9.     int num{5};
  10.  
  11.     const int badSize{ num };
  12.  
  13.     const int arrSize{ 10 };
  14.    
  15.     int arr[arrSize]{1,2,3,4,5,6,7,8,9,10};
  16.  
  17.     int sum{ 0 };
  18.  
  19.     /*for (int i{ 0 }; i < arrSize; ++i)
  20.     {
  21.         std::cout << "Enter " << i + 1 << " element of arr\n";
  22.         std::cin >> arr[i];
  23.     }*/
  24.  
  25.     //0 .. MAX_RAND 32767
  26.  
  27.     //n % 3 -> [0 .. 1]
  28.     //n % m -> [0 .. m-1]
  29.     //n % 11 -> [0..10]
  30.     /*srand(time(0));
  31.  
  32.     int start{ 10 };
  33.     int stop{ 20 };
  34.  
  35.     (start + (rand() % (start - stop + 1)))*/
  36.    
  37.     /*int start{ 10 };
  38.     int stop{ 20 };
  39.  
  40.     for (int i{ 0 }; i < arrSize; ++i)
  41.     {
  42.         arr[i] = start + (rand() % (start - stop + 1));
  43.     }*/
  44.    
  45.     /*int a = 10;
  46.     int b = 20;
  47.     int tmp;
  48.  
  49.     tmp = a;
  50.     a = b;
  51.     b = tmp;*/
  52.  
  53.  
  54.  
  55.  
  56.    
  57.  
  58.     for (int i{ 0}; i < arrSize; ++i) { std::cout << arr[i] << ' '; } std::cout << '\n';
  59.  
  60.     // [1][2][3][4][5][6][7][8][9][10]
  61.     // [10][9][8][7][6][5][4][3][2][1]
  62.  
  63.     // [][][][][][][][][][]
  64.     for (int head{ 0 }, tail{ arrSize - 1 }, tmp{0}; head < tail; ++head, --tail)
  65.     {
  66.         tmp = arr[head];
  67.         arr[head] = arr[tail];
  68.         arr[tail] = tmp;
  69.     }
  70.     std::cout << '\n';
  71.  
  72.     for (int i{ 0 }; i < arrSize; ++i) { std::cout << arr[i] << ' '; } std::cout << '\n';
  73.  
  74.     return 0;
  75. }
  76.  
  77.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement