Сравнить коммиты
6 Коммитов
af08a5c428
...
0bb7987e43
Автор | SHA1 | Дата |
---|---|---|
|
0bb7987e43 | 3 месяцев назад |
|
eeb73c32dc | 3 месяцев назад |
|
658917225a | 3 месяцев назад |
|
76ed8f0d00 | 3 месяцев назад |
|
48406dfbf6 | 3 месяцев назад |
|
0cc7e4ac3b | 3 месяцев назад |
@ -0,0 +1,54 @@
|
||||
#include "histogram.h"
|
||||
using namespace std;
|
||||
|
||||
// Ïîèñê ìàêñèìóìà è ìèíèìóìà ñðåäè îöåíîê.
|
||||
|
||||
void find_minmax(const 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(const vector<double>& numbers, size_t bin_count)
|
||||
{
|
||||
// Ïîèñê ìàêñèìóìà è ìèíèìóìà ñðåäè îöåíîê.
|
||||
double min, max;
|
||||
|
||||
find_minmax(numbers, min, max);
|
||||
// Ñîçäàíèå êîðçèí äëÿ äàëüíåéøåé ñîðòèðîâêè îöåíîê ïî íèì.
|
||||
|
||||
double bin_size = (max - min) / bin_count;
|
||||
|
||||
vector<size_t> bins(bin_count);
|
||||
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
bins[i] = 0;
|
||||
|
||||
// Ñîðòèðîâêà îöåíîê ïî êîðçèíàì.
|
||||
|
||||
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]++;
|
||||
}
|
||||
return bins;
|
||||
}
|
@ -0,0 +1,10 @@
|
||||
#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,39 @@
|
||||
#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;
|
||||
// Ïîèñê ìàêñèìàëüíîãî êîëè÷åñâà îöåíîê â îäíîì ñòîëáöå.
|
||||
|
||||
size_t max_count = bins[0];
|
||||
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
{
|
||||
if (bins[i] > max_count)
|
||||
max_count = bins[i];
|
||||
}
|
||||
|
||||
// Ñîçäàíèå ãèñòîãðàììû ïî îöåíêàì.
|
||||
|
||||
size_t height;
|
||||
size_t buf;
|
||||
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
{
|
||||
buf = bins[i];
|
||||
while (buf < max_count) // Âûðàâíèâàíèå äëÿ ÷èñåë, ìåíüøèõ ÷åì ìàêñèìàëüíîå ÷èñëî.
|
||||
{
|
||||
cout << " ";
|
||||
buf *= 10;
|
||||
}
|
||||
cout << bins[i] << "|";
|
||||
height = bins[i];
|
||||
if (max_count > MAX_ASTERISK)
|
||||
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
|
||||
for (size_t j = 1; j <= height; j++)
|
||||
cout << "*";
|
||||
cout << endl;
|
||||
}
|
||||
}
|
@ -0,0 +1,8 @@
|
||||
#ifndef TEXT_H_INCLUDED
|
||||
#define TEXT_H_INCLUDED
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
void show_histogram_text(std::vector<size_t>& bins, size_t bin_count);
|
||||
|
||||
#endif // TEXT_H_INCLUDED
|
Загрузка…
Ссылка в новой задаче