code: код разделен на функции

main
PakhomovaAY 2 месяцев назад
Родитель 36a4267a9e
Сommit 746da30d85

@ -3,28 +3,35 @@
using namespace std; using namespace std;
int main()
{
const size_t SCREEN_WIDTH = 80; const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
size_t number_count;//êîëâî ÷èñåë struct Input {
cerr << "Enter number count: "; vector<double> numbers;
size_t bin_count{};
};
Input
input_data(){
Input in;
size_t number_count;
cerr << "Enter numbers count: ";
cin >> number_count; cin >> number_count;
vector<double> numbers(number_count); //ìàññèâ ÷èñåë in.numbers.resize(number_count);
//ââîä çíà÷åíèé 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 >> numbers[i];
} }
size_t bin_count;
cerr << "Enter bin count: "; cerr << "Enter bin count: ";
cin >> bin_count; cin >> in.bin_count;
vector<size_t> bins(bin_count); //ìàññèâ êîëâà ÷èñåë â êîðçèíàõ return in;
}
double min = numbers[0]; void
double max = numbers[0]; find_minmax(const vector<double>& numbers, double& min, double& max){
min = numbers[0];
max = numbers[0];
for (double x : numbers) for (double x : numbers)
{ {
if (x < min) if (x < min)
@ -36,9 +43,16 @@ int main()
max = x; max = x;
} }
} }
}
vector <size_t>
make_histogram(const vector<double>& numbers, double bin_count){
double min, max;
find_minmax(numbers, min, max);
double bin_size = (max - min) / bin_count; //ðàçìåð êîðçèíû double bin_size = (max - min) / bin_count; //ðàçìåð êîðçèíû
vector<size_t> binss(bin_count);
size_t number_count = numbers.size();
//çàïîëíåíèå ìàññèâà áèíñ
for (size_t i = 0; i < number_count; i++) for (size_t i = 0; i < number_count; i++)
{ {
bool found = false; bool found = false;
@ -48,17 +62,21 @@ int main()
auto hi = min + (j + 1) * bin_size; auto hi = min + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) if ((lo <= numbers[i]) && (numbers[i] < hi))
{ {
bins[j]++; binss[j]++;
found = true; found = true;
} }
} }
if (!found) if (!found)
{ {
bins[bin_count - 1]++; binss[bin_count - 1]++;
} }
} }
double max_count; return binss;
}
void
show_histogram_text(const vector<size_t>& bins, double bin_count){
double max_count;
//ìàêñèìàäáíîå êîëâî ÷èñåë â êîðçèíå ñðåäè âñåõ êîðçèí //ìàêñèìàäáíîå êîëâî ÷èñåë â êîðçèíå ñðåäè âñåõ êîðçèí
max_count = bins[0]; max_count = bins[0];
for (size_t i = 0; i < bin_count; i++) for (size_t i = 0; i < bin_count; i++)
@ -82,30 +100,30 @@ int main()
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count); height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
} }
if (bins[i] < 10){
if (bins [i] < max_count){
size_t pr_count = max_count - bins[i];
for (size_t k = 0; k < pr_count; k++){
cout << " "; cout << " ";
} }
if (bins[i] < 100){
cout << " ";
} }
cout << bins[i] << "|";
for (size_t j = 0; j < height; j++) for (size_t j = 0; j < height; j++)
{ {
cout << "*"; cout << "*";
} }
cout << "|"; cout << "\n";
if (bins[i] < 100)
{
cout << " ";
} }
if (bins[i] < 10)
{
cout << " ";
}
cout << bins[i] << endl;
} }
int main()
{
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
return 0; return 0;
} }

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