code: Добавлена функция поиска максимума и минимума

main
Bob (ZharkovIG) 6 месяцев назад
Родитель 39031d280e
Сommit 2b4a50f232

@ -30,23 +30,11 @@ input_data(){
}
int
main()
{
Input in = input_data();
size_t i, bin;
//size_t number_count, bin_count, i, bin;
//cout << "Enter number count: " << endl;
//cin>>number_count;
//vector<double> numbers(number_count);
//cout<< "Enter numbers: "<<endl;
//for (size_t i = 0; i < number_count; i++){
// cin>>numbers[i];
//}
double min = numbers[0];
double max = numbers[0];
for (double x : numbers) {
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;
}
@ -54,13 +42,22 @@ main()
max = x;
}
}
}
//cout<< "Enter bin count: "<<endl;
//cin>>bin_count;
vector<size_t> bins(bin_count);
double bin_size = (max - min) / bin_count;
for (size_t i = 0; i < number_count; i++) {
int
main()
{
Input in = input_data();
//size_t i, bin;
double min, max;
find_minmax(in.numbers, min, max);
// vector<size_t> bins(bin_count);
//double bin_size = (max - min) / bin_count;
/*for (size_t i = 0; i < number_count; i++) {
bool found = false;
for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
auto lo = min + j * bin_size;
@ -79,17 +76,7 @@ main()
for (i = 0; i < bin_count; i++){
if (bins[i] > max_count) max_count = bins[i];
}
/*for(size_t bin:bins){
size_t height = bin;
height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
if(bin<100) cout<<" ";
if(bin<10) cout<<" ";
cout<<bin<<"|";
for(size_t i = 0; i < height; i++){
cout<<"*";
}
cout<<endl;
}*/
for(size_t bin:bins){
size_t height = bin;
height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
@ -100,6 +87,6 @@ main()
if(bin<100) cout<<" ";
if(bin<10) cout<<" ";
cout<<bin<<endl;
}
}*/
return 0;
}

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