Родитель
1309008182
Сommit
fa2e7974da
@ -1,47 +1,43 @@
|
|||||||
#include "histogram.h"
|
#include "histogram.h"
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
#include <numeric>
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
|
|
||||||
void find_minmax(const vector<double>& numbers, double& min, double& max) {
|
void find_minmax(const vector<double>& numbers, double& min, double& max) {
|
||||||
if (numbers.empty())
|
if (numbers.empty()) return;
|
||||||
{
|
|
||||||
min = 0;
|
|
||||||
max = 0;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
max = numbers[0];
|
max = numbers[0];
|
||||||
min = numbers[0];
|
min = numbers[0];
|
||||||
for (double x : numbers) {
|
for (double x : numbers) {
|
||||||
if (x < min) min = x;
|
if (x < min) min = x;
|
||||||
else if (x > max) max = x;
|
if (x > max) max = x;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
vector<size_t> make_histogram(vector<double> numbers, size_t bin_count) {
|
||||||
vector<size_t> make_histogram (vector<double> numbers, size_t bin_count)
|
|
||||||
{
|
|
||||||
double min, max;
|
double min, max;
|
||||||
find_minmax (numbers, min, max);
|
find_minmax(numbers, min, max);
|
||||||
double bin_size = (max - min) / bin_count;
|
double bin_size = (max - min) / bin_count;
|
||||||
vector<size_t> bins(bin_count);
|
vector<size_t> bins(bin_count);
|
||||||
for (size_t i = 0; i < numbers.size(); i++)
|
|
||||||
{
|
for (size_t i = 0; i < numbers.size(); i++) {
|
||||||
bool found = false;
|
bool found = false;
|
||||||
for (size_t j = 0; (j < bin_count - 1) && !found; j++)
|
for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
|
||||||
{
|
|
||||||
auto lo = min + j * bin_size;
|
auto lo = min + j * bin_size;
|
||||||
auto hi = min + (j + 1) * bin_size;
|
auto hi = min + (j + 1) * bin_size;
|
||||||
if ((lo <= numbers[i]) && (numbers[i] < hi))
|
if ((lo <= numbers[i]) && (numbers[i] < hi)) {
|
||||||
{
|
|
||||||
bins[j]++;
|
bins[j]++;
|
||||||
found = true;
|
found = true;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if (!found)
|
if (!found) {
|
||||||
{
|
|
||||||
bins[bin_count - 1]++;
|
bins[bin_count - 1]++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return bins;
|
return bins;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
double calculate_average_height(const vector<size_t>& bins) {
|
||||||
|
if (bins.empty()) return 0.0;
|
||||||
|
double sum = accumulate(bins.begin(), bins.end(), 0.0);
|
||||||
|
return sum / bins.size();
|
||||||
|
}
|
||||||
|
@ -1,9 +1,8 @@
|
|||||||
#ifndef HISTOGRAM_H_INCLUDED
|
#ifndef HISTOGRAM_H_INCLUDED
|
||||||
#define HISTOGRAM_H_INCLUDED
|
#define HISTOGRAM_H_INCLUDED
|
||||||
|
|
||||||
#include <vector>
|
#include <vector>
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
vector<size_t> make_histogram(vector<double> numbers, size_t bin_count);
|
vector<size_t> make_histogram(vector<double> numbers, size_t bin_count);
|
||||||
|
double calculate_average_height(const vector<size_t>& bins);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@ -1,9 +1,8 @@
|
|||||||
#ifndef SVG_H_INCLUDED
|
#ifndef SVG_H_INCLUDED
|
||||||
#define SVG_H_INCLUDED
|
#define SVG_H_INCLUDED
|
||||||
|
|
||||||
#include <vector>
|
#include <vector>
|
||||||
#include <cstddef>
|
#include <cstddef>
|
||||||
|
|
||||||
void show_histogram_svg(const std::vector<size_t>& bins);
|
void show_histogram_svg(const std::vector<size_t>& bins);
|
||||||
|
|
||||||
#endif // SVG_H_INCLUDED
|
#endif
|
||||||
|
Загрузка…
Ссылка в новой задаче