Родитель
d4884beb33
Сommit
9fe03ce72f
@ -0,0 +1,42 @@
|
||||
#include "histogram.h"
|
||||
|
||||
|
||||
using namespace std;
|
||||
|
||||
void
|
||||
find_minmax(vector<double> numbers, double& min, double& max) {
|
||||
min = numbers[0];
|
||||
max = numbers[0];
|
||||
for (double x : numbers) {
|
||||
if (x < min) {
|
||||
min = x;
|
||||
}
|
||||
else if (x > max) {
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
vector<size_t>
|
||||
make_histogram(vector<double> numbers, int bin_count){
|
||||
vector<size_t> bins(bin_count);
|
||||
double min = numbers[0];
|
||||
double max = numbers[0];
|
||||
find_minmax(numbers, min, max);
|
||||
double bin_size = (max - min) / bin_count;
|
||||
for (auto x: numbers) {
|
||||
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 <= x) && (x < hi)) {
|
||||
bins[j]++;
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
if (!found) {
|
||||
bins[bin_count - 1]++;
|
||||
}
|
||||
}
|
||||
return bins;
|
||||
}
|
@ -0,0 +1,10 @@
|
||||
#ifndef HISTOGRAM_H_INCLUDED
|
||||
#define HISTOGRAM_H_INCLUDED
|
||||
#include <vector>
|
||||
|
||||
std::vector<size_t>
|
||||
make_histogram(std::vector<double> numbers, size_t bin_count);
|
||||
|
||||
|
||||
|
||||
#endif // HISTOGRAM_H_INCLUDED
|
@ -0,0 +1,14 @@
|
||||
#include "text.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
void
|
||||
show_histogram_text(vector<size_t> bins){
|
||||
for(size_t count: bins){
|
||||
if (count < 100) cout << " ";
|
||||
if (count < 10) cout << " ";
|
||||
cout << count << "|";
|
||||
for(size_t i = 0; i < count; ++i) cout << "*";
|
||||
cout << "\n";
|
||||
}
|
||||
}
|
@ -0,0 +1,9 @@
|
||||
#ifndef TEXT_H_INCLUDED
|
||||
#define TEXT_H_INCLUDED
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
using namespace std;
|
||||
void show_histogram_text(vector<size_t> bins);
|
||||
|
||||
|
||||
#endif // TEXT_H_INCLUDED
|
Загрузка…
Ссылка в новой задаче