Родитель
c53dd6003b
Сommit
8c826cf9d8
@ -1 +1,41 @@
|
|||||||
#include "histogram.h"
|
#include "histogram.h"
|
||||||
|
|
||||||
|
std::vector<size_t> make_histogram(std::vector<double> numbers, size_t bin_count)
|
||||||
|
{
|
||||||
|
double max;
|
||||||
|
double min;
|
||||||
|
std::vector<size_t> bins;
|
||||||
|
bins.resize(bin_count);
|
||||||
|
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++) {
|
||||||
|
auto lo = min + j * bin_size;
|
||||||
|
auto hi = min + (j + 1) * bin_size;
|
||||||
|
if ((lo <= numbers[i]) && (hi > numbers[i])) {
|
||||||
|
bins[j]++;
|
||||||
|
found = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (!found) {
|
||||||
|
bins[bin_count - 1]++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return bins;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void find_minmax(std::vector<double> numbers, double& min, double& max) {
|
||||||
|
min = numbers[0];
|
||||||
|
max = numbers[0];
|
||||||
|
for (double number : numbers) {
|
||||||
|
if (min > number) {
|
||||||
|
min = number;
|
||||||
|
}
|
||||||
|
if (max < number) {
|
||||||
|
max = number;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
@ -1,9 +1,10 @@
|
|||||||
#ifndef HISTOGRAM_H_INCLUDED
|
#ifndef HISTOGRAM_H_INCLUDED
|
||||||
#define HISTOGRAM_H_INCLUDED
|
#define HISTOGRAM_H_INCLUDED
|
||||||
|
|
||||||
|
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
std::vector<size_t> make_histogram(const std::vector<double>& numbers, size_t bin_count);
|
|
||||||
|
static void find_minmax(std::vector<double> numbers, double& min, double& max);
|
||||||
|
std::vector<size_t> make_histogram(std::vector<double> numbers, size_t bin_count);
|
||||||
|
|
||||||
#endif // HISTOGRAM_H_INCLUDED
|
#endif // HISTOGRAM_H_INCLUDED
|
||||||
|
Загрузка…
Ссылка в новой задаче