Пункт 2: структурирование программы при помощи функций

main
Александр Чирка 2 дней назад
Родитель 40657991d5
Сommit 99da863dca

@ -32,6 +32,7 @@
<Add option="-Wall" /> <Add option="-Wall" />
<Add option="-fexceptions" /> <Add option="-fexceptions" />
</Compiler> </Compiler>
<Unit filename=".gitignore" />
<Unit filename="main.cpp" /> <Unit filename="main.cpp" />
<Extensions /> <Extensions />
</Project> </Project>

@ -3,71 +3,65 @@
using namespace std; using namespace std;
const size_t SCREEN_WIDTH = 80; struct Input
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
void indent(int number)
{ {
if (number < 10) vector<double> numbers;
{ size_t bin_count{};
cout << " "; };
}
else if (number < 100)
{
cout << " ";
}
else
{
cout << "";
}
}
int main() Input
input_data()
{ {
Input in;
size_t number_count; size_t number_count;
cerr << "Enter number count: ";
cin >> number_count; cin >> number_count;
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++)
{ {
cerr << "Enter numbers: "; cin >> in.numbers[i];
cin >> numbers[i];
} }
size_t bin_count; cin >> in.bin_count;
cerr << "Enter bin count: "; return in;
cin >> bin_count; }
vector<size_t> bins(bin_count);
double min = numbers[0]; void find_minmax( const vector<double>& numbers, double& minN, double& maxN)
double max = numbers[0]; {
minN = numbers[0];
maxN = numbers[0];
for (double x : numbers) for (double x: numbers)
{ {
if (x < min) if (minN > x)
{ {
min = x; minN = x;
} }
else if (x > max) if (maxN < x)
{ {
max = x; maxN = x;
} }
} }
}
size_t max_count = 0; vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count)
double bin_size = (max - min) / bin_count; {
double minN, maxN;
find_minmax( numbers, minN, maxN);
for (size_t i = 0; i < number_count; i++) vector <size_t> bins(bin_count);
double diff = (maxN - minN) / bin_count;
size_t max_count = 0;
for (size_t i = 0; i <numbers.size() ; i++)
{ {
bool found = false; bool found = false;
for (size_t 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 lo = minN + j * diff;
auto hi = min + (j + 1) * bin_size; auto hi = minN + (j + 1) * diff;
if ((lo <= numbers[i]) && (numbers[i] < hi)) if ((lo <= numbers[i]) && (hi > numbers[i]))
{ {
bins[j]++; bins[j]++;
if (bins[j] > max_count) if (bins[j] > max_count)
@ -77,7 +71,7 @@ int main()
found = true; found = true;
} }
} }
if (!found) if(!found)
{ {
bins[bin_count - 1]++; bins[bin_count - 1]++;
if (bins[bin_count - 1] > max_count) if (bins[bin_count - 1] > max_count)
@ -86,35 +80,63 @@ int main()
} }
} }
} }
return bins;
}
void show_histogram_text(const vector <size_t>& bins,size_t bin_count, size_t max_count)
{
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
bool scaling = false;
if (max_count <= 76) if (max_count > MAX_ASTERISK)
{ {
for (size_t i = 0; i < bin_count; i++) scaling = true;
{
indent(bins[i]);
cout << bins[i] << "|";
for (size_t j = 0; j < bins[i]; j++)
{
cout << "*";
}
cout << endl;
}
} }
else for (size_t i = 0; i < bin_count; i++)
{ {
for (size_t i = 0; i < bin_count; i++) if (bins[i] < 10)
{
cout << " ";
}
else if (bins[i] < 100)
{
cout << " ";
}
else
{
cout << "";
}
cout << bins[i] << '|';
size_t number_of_stars = bins[i];
if (scaling)
{ {
size_t height = 76 * (static_cast<double>(bins[i]) / max_count); if (bins[i] == max_count)
indent(bins[i]);
cout << bins[i] << "|";
for (size_t j = 0; j < height; j++)
{ {
cout << "*"; number_of_stars = MAX_ASTERISK * 1.0;
} }
cout << endl; else
{
number_of_stars = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
}
}
for (size_t j = 0; j < number_of_stars; j++)
{
cout << '*';
} }
cout << endl;
} }
return 0; }
int main()
{
size_t max_count;
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count, max_count);
} }

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