Родитель
5dcd23cc52
Сommit
4b6282431e
@ -0,0 +1,39 @@
|
||||
#include "histogram.h"
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
using namespace std;
|
||||
|
||||
static void find_minmax(const vector<double>& numbers, double& min, double& max) {
|
||||
min = numbers[0];
|
||||
max = numbers[0];
|
||||
for (double x : numbers) {
|
||||
if (x < min)
|
||||
min = x;
|
||||
if (x > max)
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
|
||||
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
|
||||
vector<size_t> bins(bin_count, 0);
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
double bin_size = (max - min) / bin_count;
|
||||
|
||||
for (size_t i = 0; i < numbers.size(); i++) {
|
||||
bool found = false;
|
||||
|
||||
for (size_t j = 0; j < bin_count - 1 && !found; j++) {
|
||||
double lo = min + j * bin_size;
|
||||
double hi = min + (j + 1) * bin_size;
|
||||
if (numbers[i] >= lo && numbers[i] < hi) {
|
||||
bins[j]++;
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!found)
|
||||
bins[bin_count - 1]++;
|
||||
}
|
||||
return bins;
|
||||
}
|
Загрузка…
Ссылка в новой задаче