diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..0a079b6 --- /dev/null +++ b/.gitignore @@ -0,0 +1,2 @@ +/bin +/obj \ No newline at end of file diff --git a/lab1.depend b/lab1.depend new file mode 100644 index 0000000..10bbee7 --- /dev/null +++ b/lab1.depend @@ -0,0 +1,5 @@ +# depslib dependency file v1.0 +1676294754 source:l:\i курс\А-2-22\Ледовской\лаб1\lab1\main.cpp + + + diff --git a/lab1.layout b/lab1.layout new file mode 100644 index 0000000..fdcb6d6 --- /dev/null +++ b/lab1.layout @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/main.cpp b/main.cpp index b32d6ea..fb7714e 100644 --- a/main.cpp +++ b/main.cpp @@ -1,33 +1,59 @@ #include #include +#include + using namespace std; -int main() -{ - double n; - size_t number_count, bin_count; - cerr<<"Enter number cout:"; - cin>>number_count; - vector numbers(number_count); - for (int i =0;i>numbers[i]; + + +struct Input { + vector numbers; + size_t bin_count{}; +}; + +Input +input_data() { + size_t number_count; + cin >> number_count; + Input in; + in.numbers.resize(number_count); + + for (size_t i = 0; i < number_count; i++) { + cin >> in.numbers[i]; } - cerr<<"Enter bin_count"; - cin>>bin_count; - vector bins(bin_count); - double min = numbers[0]; - double max = numbers[0]; - for (double x : numbers){ - if (x> in.bin_count; + return in; +} + +void find_minmax(const vector& numbers, double& min, double& max) { + min = numbers[0]; + for (auto i = 0; i < numbers.size(); i++) { + if (numbers[i] < min) { + min = numbers[i]; } - else if (x>max){ - max=x; + } + + max = numbers[0]; + for (auto i = 0; i < numbers.size(); i++) { + if (numbers[i] > max) { + max = numbers[i]; } } - double bin_size= (max-min)/bin_count; - for (size_t i = 0; i < number_count; i++) { + +} + +vector make_histogram(const vector& numbers, size_t bin_count) { + + vector bins(bin_count); + vector binss(bin_count); + + double max, min; + find_minmax(numbers, min, max); + double bin_size = (max / min) / bin_count; + + for (size_t i = 0; i < numbers.size(); i++) { bool found = false; for (size_t j = 0; (j < bin_count - 1) && !found; j++) { auto lo = min + j * bin_size; @@ -41,45 +67,49 @@ int main() bins[bin_count - 1]++; } } - size_t maxbin=0; - for (size_t i=0; i max_count) { + max_count = bins[i]; } - if (bins[i]<10){ - cout<<" "; + } + + if (max_count > 76) { + + for (size_t i = 0; i < bin_count; i++) { + int count = bins[i]; + size_t height = 76 * (static_cast(count) / max_count); + bins[i] = height; } - cout<<" "<=76){ - size_t height= 76*(static_cast(count)/maxbin); - for (size_t j=0; j bins, size_t bin_count ) { + + for (size_t i = 0; i < bin_count; i++) { + if (bins[i] < 100) { + cout << " "; } - else{ - for (size_t j=0; j