3 Разделение программы на файлы

main
PodlovchenkoDD 14 часов назад
Родитель 36661db3c3
Сommit 4ed40a5345

@ -1,5 +1,9 @@
#include <iostream>
#include <vector>
#include "histogram.h"
#include "text.h"
#include "histogram_internal.h"
using namespace std;
@ -14,65 +18,18 @@ Input input_data() {
cout << "Ââåäèòå êîëè÷åñòâî îöåíîê: ";
cin >> number_count;
Input in; // Ýêçåìïëÿð ñòðóêòóðû Input
in.numbers.resize(number_count); // Èçìåíÿåì ðàçìåð âåêòîðà
Input in;
in.numbers.resize(number_count);
cout << "Ââåäèòå îöåíêè:\n";
for (size_t i = 0; i < number_count; i++) {
cin >> in.numbers[i]; // Ââîäèì ýëåìåíòû âåêòîðà
cin >> in.numbers[i];
}
cout << "Ââåäèòå êîëè÷åñòâî êîðçèí: ";
cin >> in.bin_count; // Ââîäèì êîëè÷åñòâî êîðçèí
return in; // Âîçâðàùàåì ñòðóêòóðó
}
//ïîèñê ìèíèìóìà è ìàêñèìóìà
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;
}
if (x > max) {
max = x;
}
}
}
//ñîçäàíèå ãèñòîãðàììû
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
double min, max;
find_minmax(numbers, min, max);
cin >> in.bin_count;
double bin_size = (max - min) / bin_count;
vector<size_t> bins(bin_count, 0);
for (double number : numbers) {
size_t bin_index = static_cast<size_t>((number - min) / bin_size);
if (bin_index >= bin_count) {
bin_index = bin_count - 1;
}
bins[bin_index]++;
}
return bins;
}
//âûâîä
void show_histogram_text(const vector<size_t>& bins, double min, double bin_size) {
for (size_t i = 0; i < bins.size(); i++) {
double lo = min + i * bin_size;
double up = min + (i + 1) * bin_size;
cout << bins[i] << " | ";
for (size_t j = 0; j < bins[i]; j++) {
cout << "*";
}
cout << endl;
}
return in;
}
int main() {
@ -86,7 +43,7 @@ int main() {
double bin_size = (max - min) / in.bin_count;
show_histogram_text(bins, min, bin_size);
show_histogram_text(bins, bin_size);
return 0;
}

@ -0,0 +1,36 @@
#include <iostream>
#include <vector>
#include "histogram.h"
using namespace std;
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;
}
if (x > max) {
max = x;
}
}
}
//ñîçäàíèå ãèñòîãðàììû
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
double min, max;
find_minmax(numbers, min, max);
double bin_size = (max - min) / bin_count;
vector<size_t> bins(bin_count, 0);
for (double number : numbers) {
size_t bin_index = static_cast<size_t>((number - min) / bin_size);
if (bin_index >= bin_count) {
bin_index = bin_count - 1;
}
bins[bin_index]++;
}
return bins;
}

@ -0,0 +1,10 @@
#ifndef HISTOGRAM_H_INCLUDED
#define HISTOGRAM_H_INCLUDED
#include <vector>
std::vector<size_t>
make_histogram(const std::vector<double>& numbers, size_t bin_count);
#endif // HISTOGRAM_H_INCLUDED

@ -0,0 +1,10 @@
#ifndef HISTOGRAM_INTERNAL_H_INCLUDED
#define HISTOGRAM_INTERNAL_H_INCLUDED
#include <vector>
std::vector<size_t>
find_minmax(const std::vector<double>& numbers, double& min, double& max);
#endif // HISTOGRAM_INTERNAL_H_INCLUDED

@ -0,0 +1,16 @@
#include <iostream>
#include <vector>
#include "text.h"
using namespace std;
//âûâîä
void show_histogram_text(const vector<size_t>& bins, double bin_size) {
for (size_t i = 0; i < bins.size(); i++) {
cout << bins[i] << " | ";
for (size_t j = 0; j < bins[i]; j++) {
cout << "*";
}
cout << endl;
}
}

@ -0,0 +1,8 @@
#ifndef TEXT_H_INCLUDED
#define TEXT_H_INCLUDED
#include <vector>
void show_histogram_text(const std::vector<size_t>& bins, double bin_size);
#endif // TEXT_H_INCLUDED
Загрузка…
Отмена
Сохранить