Родитель
933f804c11
Сommit
4cfa34fd19
@ -0,0 +1,55 @@
|
||||
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
#include "histogram.h"
|
||||
using namespace std;
|
||||
|
||||
void static find_minmax(const vector<double> &numbers, double &min, double &max)
|
||||
{
|
||||
max = numbers[0];
|
||||
min = numbers[1];
|
||||
for (double x: numbers)
|
||||
{
|
||||
if (x < min)
|
||||
{
|
||||
min = x;
|
||||
}
|
||||
else if (x > max)
|
||||
{
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
return;
|
||||
|
||||
}
|
||||
|
||||
vector<size_t> make_histogram (vector<double> numbers, size_t bin_count)
|
||||
{
|
||||
|
||||
double minn;
|
||||
double maxx;
|
||||
find_minmax (numbers, minn, maxx);
|
||||
double bin_size = (maxx - minn) / 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 = minn + j * bin_size;
|
||||
auto hi = minn + (j + 1) * bin_size;
|
||||
if ((lo <= numbers[i]) && (numbers[i] < hi))
|
||||
{
|
||||
bins[j]++;
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
if (!found)
|
||||
{
|
||||
bins[bin_count - 1]++;
|
||||
}
|
||||
}
|
||||
return bins;
|
||||
}
|
||||
|
||||
|
@ -0,0 +1,8 @@
|
||||
#ifndef HISTOGRAM_H_INCLUDED
|
||||
#define HISTOGRAM_H_INCLUDED
|
||||
#include <vector>
|
||||
|
||||
std::vector<size_t>
|
||||
make_histogram(const std::vector<double> numbers, size_t bin_count);
|
||||
|
||||
#endif // HISTOGRAM_H_INCLUDED
|
@ -0,0 +1,49 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
#include "text.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
void show_histogram_text(vector<size_t> bins, size_t bin_count)
|
||||
{
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
double max_bin;
|
||||
size_t height;
|
||||
max_bin = bins[0];
|
||||
height = bins[0];
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
{
|
||||
if (bins[i] > max_bin){
|
||||
max_bin = bins[i];
|
||||
}
|
||||
}
|
||||
|
||||
bool flag = false;
|
||||
if ( max_bin > 80)
|
||||
{
|
||||
flag = true;
|
||||
}
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
{
|
||||
if (bins[i] < 100)
|
||||
cout << " ";
|
||||
if (bins[i] < 10)
|
||||
cout << " ";
|
||||
cout << bins[i] << "|";
|
||||
if( flag == true)
|
||||
{
|
||||
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_bin);
|
||||
}
|
||||
else
|
||||
{
|
||||
height = bins[i];
|
||||
}
|
||||
for (size_t j = 0; j < height; j++)
|
||||
{
|
||||
cout << "*";
|
||||
}
|
||||
cout << endl;
|
||||
|
||||
}
|
||||
}
|
@ -0,0 +1,8 @@
|
||||
#ifndef TEXT_H_INCLUDED
|
||||
#define TEXT_H_INCLUDED
|
||||
#include <vector>
|
||||
|
||||
void
|
||||
show_histogram_text(std::vector<size_t> bins, size_t bin_count);
|
||||
|
||||
#endif // TEXT_H_INCLUDED
|
Загрузка…
Ссылка в новой задаче