Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
69 строки
1.2 KiB
C++
69 строки
1.2 KiB
C++
#include "histogram.h"
|
|
#include <vector>
|
|
|
|
using namespace std;
|
|
|
|
|
|
void
|
|
static find_minmax(const vector<double>& numbers, double& min, double& max) {
|
|
min = numbers[0];
|
|
max = numbers[0];
|
|
for(size_t i=0; i< numbers.size(); i++){
|
|
if(min > numbers[i])
|
|
min = numbers[i];
|
|
if(max < numbers[i])
|
|
max = numbers[i];
|
|
}}
|
|
|
|
vector<size_t> make_histogram(vector<double>& numbers, size_t bin_count)
|
|
{
|
|
|
|
vector<size_t> bins(bin_count);
|
|
vector<size_t> binss(bin_count);
|
|
|
|
double max, min;
|
|
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]) && (numbers[i] < hi))
|
|
{
|
|
bins[j]++;
|
|
found = true;
|
|
}
|
|
}
|
|
if (!found)
|
|
{
|
|
bins[bin_count - 1]++;
|
|
}
|
|
}
|
|
|
|
int max_count = bins[0];
|
|
for (size_t i = 0; i < bin_count; i++)
|
|
{
|
|
if (bins[i] > max_count)
|
|
{
|
|
max_count = bins[i];
|
|
}
|
|
}
|
|
|
|
if (max_count > 76)
|
|
{
|
|
|
|
for (size_t i = 0; i < bin_count; i++)
|
|
{
|
|
int count = bins[i];
|
|
size_t height = 76 * (static_cast<double>(count) / max_count);
|
|
bins[i] = height;
|
|
}
|
|
}
|
|
|
|
return bins;
|
|
}
|