Родитель
807629dfb5
Сommit
22674d1f7c
@ -1 +1,42 @@
|
||||
#include "histogram.h"
|
||||
#include <vector>
|
||||
#include <algorithm>
|
||||
|
||||
size_t find_minmax(const std::vector<double>& numbers, double& min, double& max) {
|
||||
if (numbers.empty()) {
|
||||
min = max = 0;
|
||||
return 0;
|
||||
}
|
||||
min = numbers[0];
|
||||
max = numbers[0];
|
||||
for (double number : numbers) {
|
||||
if (number < min) {
|
||||
min = number;
|
||||
}
|
||||
if (number > max) {
|
||||
max = number;
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
std::vector<size_t> make_histogram(const std::vector<double>& numbers, size_t bin_count) {
|
||||
std::vector<size_t> bins(bin_count, 0);
|
||||
if (numbers.empty() || bin_count == 0) {
|
||||
return bins;
|
||||
}
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
if (max == min) {
|
||||
return bins; // Âîçâðàùàåì ïóñòûå êîðçèíû, òàê êàê ãèñòîãðàììà íå ìîæåò áûòü ïîñòðîåíà
|
||||
}
|
||||
double bin_width = (max - min) / bin_count;
|
||||
for (double number : numbers) {
|
||||
size_t bin_index = static_cast<size_t>((number - min) / bin_width);
|
||||
if (bin_index >= bin_count) {
|
||||
bin_index = bin_count - 1; // Îáðàáîòêà êðàéíåãî ñëó÷àÿ max == number
|
||||
}
|
||||
bins[bin_index]++;
|
||||
}
|
||||
return bins;
|
||||
};
|
||||
|
||||
|
Загрузка…
Ссылка в новой задаче