Родитель
fa2e7974da
Сommit
3e7b5fd15a
@ -1,6 +1,10 @@
|
||||
#ifndef HISTOGRAM_INTERNAL_H_INCLUDED
|
||||
#define HISTOGRAM_INTERNAL_H_INCLUDED
|
||||
|
||||
#include <vector>
|
||||
|
||||
void find_minmax(const std::vector<double>& numbers, double& min, double& max);
|
||||
|
||||
double calculate_average_height(const std::vector<size_t>& bins);
|
||||
|
||||
#endif // HISTOGRAM_INTERNAL_H_INCLUDED
|
||||
|
@ -1,37 +1,9 @@
|
||||
#include "text.h"
|
||||
#include <iostream>
|
||||
#ifndef TEXT_H_INCLUDED
|
||||
#define TEXT_H_INCLUDED
|
||||
|
||||
#include <vector>
|
||||
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];
|
||||
}
|
||||
}
|
||||
void show_histogram_text(vector<size_t> bins, size_t bin_count);
|
||||
|
||||
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;
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
Загрузка…
Ссылка в новой задаче