code: Добавлены функции make_histogram и show_histogram_text
Этот коммит содержится в:
73
main.cpp
73
main.cpp
@@ -12,6 +12,7 @@ struct Input {
|
|||||||
|
|
||||||
Input
|
Input
|
||||||
input_data(){
|
input_data(){
|
||||||
|
|
||||||
size_t number_count;
|
size_t number_count;
|
||||||
cerr << "Enter number_count: ";
|
cerr << "Enter number_count: ";
|
||||||
cin >> number_count;
|
cin >> number_count;
|
||||||
@@ -19,7 +20,7 @@ input_data(){
|
|||||||
Input in;
|
Input in;
|
||||||
in.numbers.resize(number_count);
|
in.numbers.resize(number_count);
|
||||||
cerr << "Enter numbers: ";
|
cerr << "Enter numbers: ";
|
||||||
for (size_t i = 0; i < number_count; i++) {
|
for (size_t i = 0; i < number_count; i++){
|
||||||
cin >> in.numbers[i];
|
cin >> in.numbers[i];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -27,11 +28,10 @@ input_data(){
|
|||||||
cin >> in.bin_count;
|
cin >> in.bin_count;
|
||||||
|
|
||||||
return in;
|
return in;
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void
|
void
|
||||||
find_minmax(const vector<double>& numbers, double& min, double& max) {
|
find_minmax(vector<double>& numbers, double& min, double& max){
|
||||||
min = numbers[0];
|
min = numbers[0];
|
||||||
max = numbers[0];
|
max = numbers[0];
|
||||||
for (double x : numbers) {
|
for (double x : numbers) {
|
||||||
@@ -44,39 +44,34 @@ find_minmax(const vector<double>& numbers, double& min, double& max) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
vector<size_t> make_histogram(vector<double>& numbers, size_t bin_count) {
|
||||||
int
|
|
||||||
main()
|
|
||||||
{
|
|
||||||
Input in = input_data();
|
|
||||||
|
|
||||||
//size_t i, bin;
|
|
||||||
double min, max;
|
double min, max;
|
||||||
find_minmax(in.numbers, min, max);
|
find_minmax(numbers, min, max);
|
||||||
|
|
||||||
// vector<size_t> bins(bin_count);
|
vector<size_t> bins(bin_count, 0);
|
||||||
//double bin_size = (max - min) / bin_count;
|
double bin_size = (max - min) / bin_count;
|
||||||
|
|
||||||
/*for (size_t i = 0; i < number_count; i++) {
|
for (double number : numbers) {
|
||||||
bool found = false;
|
size_t bin_index = bin_count - 1; // default to last bin
|
||||||
for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
|
if (number < max) {
|
||||||
auto lo = min + j * bin_size;
|
bin_index = static_cast<size_t>((number - min) / 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]++;
|
|
||||||
}
|
}
|
||||||
|
bins[bin_index]++;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return bins;
|
||||||
|
}
|
||||||
|
|
||||||
|
void show_histogram_text(const vector<size_t>& bins){
|
||||||
|
size_t i;
|
||||||
size_t height = 0;
|
size_t height = 0;
|
||||||
size_t max_count = 0;
|
size_t max_count = 0;
|
||||||
for (i = 0; i < bin_count; i++){
|
for (size_t x: bins) {
|
||||||
if (bins[i] > max_count) max_count = bins[i];
|
if (x > max_count) {
|
||||||
|
max_count = x;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
if (max_count > MAX_ASTERISK) {
|
||||||
for(size_t bin:bins){
|
for(size_t bin:bins){
|
||||||
size_t height = bin;
|
size_t height = bin;
|
||||||
height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
|
height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
|
||||||
@@ -87,6 +82,26 @@ main()
|
|||||||
if(bin<100) cout<<" ";
|
if(bin<100) cout<<" ";
|
||||||
if(bin<10) cout<<" ";
|
if(bin<10) cout<<" ";
|
||||||
cout<<bin<<endl;
|
cout<<bin<<endl;
|
||||||
}*/
|
}
|
||||||
|
} else {
|
||||||
|
for(size_t bin:bins){
|
||||||
|
size_t height = bin;
|
||||||
|
for(size_t i = 0; i < height; i++){
|
||||||
|
cout<<"*";
|
||||||
|
}
|
||||||
|
cout<<"|";
|
||||||
|
if(bin<100) cout<<" ";
|
||||||
|
if(bin<10) cout<<" ";
|
||||||
|
cout<<bin<<endl;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int
|
||||||
|
main()
|
||||||
|
{
|
||||||
|
auto in = input_data();
|
||||||
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
||||||
|
show_histogram_text(bins);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|||||||
Ссылка в новой задаче
Block a user