code:finished[5]
Этот коммит содержится в:
@@ -26,9 +26,12 @@ std::vector<size_t> make_histogram(std::vector<double> numbers, size_t bin_count
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
void find_minmax(std::vector<double> numbers, double& min, double& max) {
|
bool find_minmax(std::vector<double> numbers, double& min, double& max) {
|
||||||
min = numbers[0];
|
min = numbers[0];
|
||||||
max = numbers[0];
|
max = numbers[0];
|
||||||
|
if(numbers.size()==0){
|
||||||
|
return false;
|
||||||
|
}
|
||||||
for (double number : numbers) {
|
for (double number : numbers) {
|
||||||
if (min > number) {
|
if (min > number) {
|
||||||
min = number;
|
min = number;
|
||||||
@@ -37,5 +40,5 @@ void find_minmax(std::vector<double> numbers, double& min, double& max) {
|
|||||||
max = number;
|
max = number;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return;
|
return true;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -4,7 +4,7 @@
|
|||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
|
|
||||||
void find_minmax(std::vector<double> numbers, double& min, double& max);
|
bool find_minmax(std::vector<double> numbers, double& min, double& max);
|
||||||
std::vector<size_t> make_histogram(std::vector<double> numbers, size_t bin_count);
|
std::vector<size_t> make_histogram(std::vector<double> numbers, size_t bin_count);
|
||||||
|
|
||||||
#endif // HISTOGRAM_H_INCLUDED
|
#endif // HISTOGRAM_H_INCLUDED
|
||||||
|
|||||||
Ссылка в новой задаче
Block a user