Advertisement
avr39-ripe

sortMin

Jan 22nd, 2020
214
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.84 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. int main()
  4. {
  5.     const int arrSize = 10;
  6.     //int arr[arrSize] { 6,1,4,2,8,9,11,3,2,1 };
  7.     //int arr[arrSize] { 1,1,1,2,2,9,11,1,2,1 };
  8.     //int arr[arrSize] { 1,2,3,4,5,6,7,8,9,10 };
  9.     //int arr[arrSize] {0};
  10.  
  11.     int arr[arrSize]{6,4,8,11,25,1,3,5,9,0};
  12.    
  13.  
  14.     for (int i = 0; i < arrSize; i++) { std::cout << arr[i] << ' '; } std::cout << std::endl;
  15.  
  16.     for (int head = 0; head < arrSize; head++)
  17.     {
  18.         int minIdx = head;
  19.         for (int minHead = head; minHead < arrSize; minHead++)
  20.         {
  21.             if (arr[minHead] <= arr[minIdx])
  22.             {
  23.                 minIdx = minHead;
  24.             }
  25.         }
  26.  
  27.             int tmp = arr[minIdx];
  28.             arr[minIdx] = arr[head];
  29.             arr[head] = tmp;
  30.  
  31.             for (int i = 0; i < arrSize; i++) { std::cout << arr[i] << ' '; } std::cout << std::endl;
  32.     }
  33.  
  34.     for (int i = 0; i < arrSize; i++) { std::cout << arr[i] << ' '; } std::cout << std::endl;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement