code: структурирование программы

master
lab01(PokhilAA) 12 месяцев назад
Родитель 9bda151248
Сommit c8a191d414

@ -1,66 +1,75 @@
#include <iostream> #include <iostream>
#include <vector> #include <vector>
using namespace std; using namespace std;
int main()
{ struct Input {
vector<double> numbers;
size_t bin_count{};
};
Input
input_data() {
size_t number_count; size_t number_count;
cerr << "Enter number count: "; cout << "Enter number count: ";
cin >> number_count; cin >> number_count;
Input in;
in.numbers.resize(number_count);
vector<double> numbers(number_count); vector<double> numbers(number_count);
for (size_t i=0; i<number_count; i++) for (size_t i = 0; i < number_count; i++)
{ {
cin>>numbers[i]; cin >> in.numbers[i];
} }
size_t bin_count; size_t bin_count;
cerr << "Enter count bin: "; cout << "Enter count bin : ";
cin >>bin_count; cin >> in.bin_count;
size_t interval; return in;
cerr << "Enter interval: "; }
cin >> interval;
double min = numbers[0]; void
double max = numbers[0]; find_minmax(const vector<double>& numbers, double& min, double& max) {
for (double x : numbers) min = numbers[0];
{ max = numbers[0];
if (x < min) for (double x : numbers) {
{ if (x < min) {
min = x; min = x;
} }
else if (x > max) else if (x > max) {
{
max = x; max = x;
}
} }
vector<size_t> bins(bin_count); }
}
vector <double>
make_histogram(const vector<double>& numbers, size_t bin_count){
vector<double> bins (bin_count);
double min = 0, max = 0;
find_minmax(numbers, min, max);
double bin_size = (max - min) / bin_count; double bin_size = (max - min) / bin_count;
for (size_t i = 0; i < number_count; i++) for (int i = 0; i < numbers.size(); i++) {
{ bool found = false;
bool found = false; for (int j = 0; (j < bin_count - 1) && !found; j++) {
for (size_t j = 0; (j < bin_count - 1) && !found; j++) auto lo = min + j * bin_size;
{ auto hi = min + (j + 1) * bin_size;
auto lo = min + j * bin_size; if ((lo <= numbers[i]) && (numbers[i] < hi)) {
auto hi = min + (j + 1) * bin_size; bins[j]++;
if ((lo <= numbers[i]) && (numbers[i] < hi)) found = true;
{ }
bins[j]++; }
found = true; if (!found) {
bins[bin_count - 1]++;
} }
}
if (!found)
{
bins[bin_count - 1]++;
}
} }
const size_t SCREEN_WIDTH = 80; return bins;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; }
size_t height = 0;
size_t bin_max =0; void
for (double y : bins) show_histogram_text (const vector<double>& bins,size_t MAX_ASTERISK, size_t bin_count){
size_t bin_max = 0;
size_t height = 0;
for (double x : bins)
{ {
if (y > bin_max) if (x > bin_max){
{ bin_max = x;
bin_max = y;
} }
} }
for (size_t bin: bins) for (size_t bin: bins)
@ -82,46 +91,15 @@ int main()
} }
cout << endl; cout << endl;
} }
size_t len_numb = 0;
size_t maxbin = bins[0];
if (interval < 4 and interval > 9){
cout << "ERROR";
}
else{
for (size_t bin: bins)
{
if (bin>maxbin){
maxbin=bin;
}
}
size_t maxb=maxbin;
while(maxbin){
maxbin/=10;
len_numb++;
}
for(size_t j=1; j<=len_numb; j++){
cout<<" ";
}
cout<<"|";
int int_part;
if (maxb%interval==0){
int_part=maxb/interval;
}
else{
int_part=(maxb/interval)+1;
}
for(size_t i=1;i<=int_part;i++){
cout<<"-----|";
}
cout<<endl;
for(size_t j=1; j<=len_numb; j++){
cout<<" ";
}
cout<<"0 "<<interval;
for(size_t i=1;i<int_part;i++){
cout<<" "<<interval*int_part;
}
} }
int main(){
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, MAX_ASTERISK, in.bin_count);
return 0; return 0;
} }

Загрузка…
Отмена
Сохранить