новый код до пунтка 4

master
LedovskojMM 2 лет назад
Родитель 3e9c0860c5
Сommit 7db91c5943

2
.gitignore поставляемый

@ -0,0 +1,2 @@
/bin
/obj

@ -0,0 +1,5 @@
# depslib dependency file v1.0
1676294754 source:l:\i êóðñ\À-2-22\Ëåäîâñêîé\ëàá1\lab1\main.cpp
<iostream>
<vector>

@ -0,0 +1,10 @@
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<CodeBlocks_layout_file>
<FileVersion major="1" minor="0" />
<ActiveTarget name="Debug" />
<File name="main.cpp" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="296" topLine="0" />
</Cursor>
</File>
</CodeBlocks_layout_file>

@ -1,33 +1,59 @@
#include <iostream> #include <iostream>
#include <vector> #include <vector>
#include <cmath>
using namespace std; using namespace std;
int main()
{
double n;
size_t number_count, bin_count;
cerr<<"Enter number cout:";
cin>>number_count;
vector<double> numbers(number_count);
for (int i =0;i<number_count;i++){
cin>>numbers[i];
struct Input {
vector<double> 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; cout << "Enter number of bins";
vector<size_t> bins(bin_count); cin >> in.bin_count;
double min = numbers[0]; return in;
double max = numbers[0]; }
for (double x : numbers){
if (x<min){ void find_minmax(const vector<double>& numbers, double& min, double& max) {
min=x; 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<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
vector<size_t> bins(bin_count);
vector<size_t> 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; 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 = min + j * bin_size;
@ -41,45 +67,49 @@ int main()
bins[bin_count - 1]++; bins[bin_count - 1]++;
} }
} }
size_t maxbin=0;
for (size_t i=0; i<bin_count; i++){
if (maxbin< bins[i]){
maxbin=bins[i];
}
int max_count = bins[0];
for (size_t i = 0; i < bin_count; i++) {
if (bins[i] > max_count) {
max_count = bins[i];
} }
size_t k=0;
for (size_t i=0; i<bin_count; i++){
if (bins[i]<100){
cout<<" ";
}
if (bins[i]<10){
cout<<" ";
} }
cout<<" "<<bins[i]<<"|";
size_t count = bins[i]; if (max_count > 76) {
if (maxbin>=76){
size_t height= 76*(static_cast<double>(count)/maxbin); for (size_t i = 0; i < bin_count; i++) {
for (size_t j=0; j<bins[i]; j++){ int count = bins[i];
if (j<height) size_t height = 76 * (static_cast<double>(count) / max_count);
cout<<"*"; bins[i] = height;
else
break;
} }
} }
else{ return bins;
for (size_t j=0; j<bins[i]; j++){ }
cout<<"*";
void show_histogram_text(vector <size_t> bins, size_t bin_count ) {
for (size_t i = 0; i < bin_count; i++) {
if (bins[i] < 100) {
cout << " ";
} }
if (bins[i] < 10) {
cout << " ";
} }
cout<<endl; cout << bins[i] << "|";
if (k < bin_count - 1){ for (size_t j = 0; j < bins[i]; j++) {
auto step = min + (k + 1) * bin_size; cout << "*";
cout.precision(3);
cout<<step;
k+=1;
cout<<endl;
} }
cout << "\n";
} }
return 0;
} }
int main()
{
Input in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
}

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