Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
52 строки
1.4 KiB
C++
52 строки
1.4 KiB
C++
#include <math.h>
|
|
#include <iostream>
|
|
#include <conio.h>
|
|
#include <vector>
|
|
#include "histogram.h"
|
|
using namespace std;
|
|
|
|
static
|
|
find_minmax(vector<double> numbers, double &min, double &max) {
|
|
min = numbers[0];
|
|
max = numbers[0];
|
|
for (size_t i = 1; i < numbers.size(); i++) {
|
|
if (min > numbers[i])
|
|
min = numbers[i];
|
|
if (max < numbers[i])
|
|
max = numbers[i];
|
|
}
|
|
}
|
|
|
|
vector <size_t> make_histogramm(vector<double>numbers, size_t bin_count){
|
|
double min, max;
|
|
find_minmax(numbers, min, max);
|
|
double binSize = (max - min) / bin_count;
|
|
vector<size_t> bins(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 * binSize;
|
|
auto hi = min + (j + 1) * binSize;
|
|
if ((numbers[i] >= lo) && (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;
|
|
}
|