code: вынесены функции из основного кода

lab01.cbp

@@ -32,6 +32,11 @@
 			<Add option="-Wall" />
 			<Add option="-fexceptions" />
 		</Compiler>
+		<Unit filename=".gitignore" />
+		<Unit filename="histogram.cpp" />
+		<Unit filename="histogram.h">
+			<Option target="&lt;{~None~}&gt;" />
+		</Unit>
 		<Unit filename="main.cpp" />
 		<Extensions>
 			<lib_finder disable_auto="1" />

main.cpp

@@ -2,95 +2,51 @@
 #include <vector>
 using namespace std;
 
-int main()
-{
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    //ââîä ÷èñëà ýëåìåíòîâ ìàññèâà
-    size_t number_count;
-    cerr << "Enter number count: ";
-    cin >> number_count;
-    //èíèöèàëèçàöèÿ ìàññèâà ÷èñåë è çàïîëíåíèå
-    vector<double> numbers(number_count);
-    for (size_t i = 0; i < number_count; i++)
-    {
-        cin >> numbers[i];
+int main(){
+    size_t number;
+    cout<<"Enter number count: ";
+    cin>> number;
+
+    vector <double> count(number);
+    cout<< "enter chicla";
+    for (int i=0;i<number;i++){
+        cin>>count[i];
     }
-    //ââîä ÷èñëà êîðçèí
+
     size_t bin_count;
-    cerr << "Enter number bin: ";
+    cout<<"Enter number bin_count: ";
     cin>> bin_count;
-    //èíèöèàëèçàöèÿ ìàññèâà êîðçèí
+
     vector <size_t>  bins(bin_count);
-    //ïîèñêè ýêñòðåìóìîâ
-    double min = numbers[0];
-    double max = numbers[0];
-    for (double x : numbers)
-    {
-        if (x < min)
-        {
-            min = x;
+
+    double max=count[0];
+    for (size_t i=0;i<number; i++){
+        if(count[i]> max){
+                max=count[i];
+           }
     }
-        else if (x > max)
-        {
-            max = x;
+
+    double min=count[0];
+    for (size_t i=0;i<number; i++){
+        if(count[i]<min){
+                min=count[i];
            }
     }
+
     double bin_size = (max-min)/bin_count;
-    //ðàñïðåäåëåíèå ïî êîðçèíàì
-    for (size_t i = 0; i < number_count; i++)
-    {
+
+    for(size_t i = 0; i<number; i++){
         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 hi = min+(j+1)*bin_size;
-            if ((lo <= numbers[i]) && (numbers[i] < hi))
-            {
+            if ((lo<=count[i])&&(count[i]<hi)){
                 bins[j]++;
                 found=true;
             }
         }
-        if (!found)
-        {
+        if (!found){
             bins[bin_count-1]++;
         }
     }
-    //âûâîäû ðåçóëüòàòîâ
-    size_t max_count = bins[0];
-    for (size_t i = 0; i < bin_count; i++)
-    {
-        if (bins[i] > max_count) {
-            max_count = bins[i];
-        }
-    }
-
-    for (size_t i = 0; i < bin_count; i++)
-    {
-        if (bins[i]<10) {
-            cout << "  " << bins[i] << "|";
-            }
-        else if (bins[i]<100) {
-            cout << " " << bins[i] << "|";
-        }
-        else if (bins[i]<1000) {
-            cout << bins[i] << "|";
-        }
-
-        size_t height;
-
-        if (max_count<=MAX_ASTERISK) {
-            height = bins[i];
-        }
-        else {
-            height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
-        }
-
-        for (size_t j = 0; j < height; j++) {
-            cout << "*";
-        }
-        cout << endl;
-    }
-
-    return 0;
 }