| 124 | } |
| 125 | |
| 126 | void getHighest(const std::vector<unsigned>& sortedNumbers, unsigned(&highest)[5]) |
| 127 | { |
| 128 | const auto numHighest{ static_cast<int>(std::size(highest)) }; |
| 129 | |
| 130 | for (int i{}; i < numHighest; ++i) |
| 131 | { |
| 132 | const int numberIndex{ static_cast<int>(sortedNumbers.size()) - numHighest + i }; |
| 133 | if (numberIndex >= 0) |
| 134 | highest[i] = sortedNumbers[numberIndex]; |
| 135 | else |
| 136 | highest[i] = NOT_AVAILABLE; |
| 137 | } |
| 138 | } |
| 139 | |
| 140 | void getLowest(const std::vector<unsigned>& sortedNumbers, unsigned(&lowest)[5]) |
| 141 | { |