Родитель
							
								
									4a1ac0d655
								
							
						
					
					
						Сommit
						0d7352e062
					
				| @ -0,0 +1,46 @@ | ||||
| #include "histogram.h" | ||||
| using namespace std; | ||||
| static 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; | ||||
|         } | ||||
|         else if (x > max) | ||||
|         { | ||||
|             max = x; | ||||
|         } | ||||
|     } | ||||
| } | ||||
| vector<double> make_histogram(const vector<double>& numbers, size_t bin_count) | ||||
| { | ||||
|     vector <double> bins; | ||||
|     double min, max; | ||||
|     find_minmax(numbers, min, max); | ||||
|     int number_count = numbers.size(); | ||||
|     bins.resize(bin_count); | ||||
|     double bin_size = (max - min) / bin_count; | ||||
|     for (int i = 0; i < number_count; i++) | ||||
|     { | ||||
|         bool found = false; | ||||
|         for (int 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)) | ||||
|             { | ||||
|                 bins[j]++; | ||||
|                 found = true; | ||||
|             } | ||||
| 
 | ||||
|         } | ||||
|         if (!found) | ||||
|         { | ||||
|             bins[bin_count - 1]++; | ||||
|         } | ||||
|     } | ||||
|     return bins; | ||||
| } | ||||
| @ -0,0 +1,5 @@ | ||||
| #ifndef HISTOGRAM_H_INCLUDED | ||||
| #define HISTOGRAM_H_INCLUDED | ||||
| #include <vector> | ||||
| std::vector<double> make_histogram(const std::vector<double>& numbers, size_t bin_count); | ||||
| #endif // HISTOGRAM_H_INCLUDED
 | ||||
| @ -0,0 +1,41 @@ | ||||
| #include <iostream> | ||||
| #include "show_histogram.h" | ||||
| using namespace std; | ||||
| void show_histogram_text(const vector<double>& bins) | ||||
| { | ||||
|     //Íàõîäèì ìàêñèìóì çíà÷åíèé êîðçèí
 | ||||
|     int max_count = bins[0]; | ||||
|     for (int x : bins) | ||||
|     { | ||||
|         if (x > max_count) max_count = x; | ||||
|     } | ||||
|     //Îïðåäåëÿåì íàäî ëè ìàñøòàáèðîâàòü äàííûå
 | ||||
|     int K; | ||||
|     if (max_count <= (MAX_STR_LNG - PREFIX)) | ||||
|     { | ||||
|         K = 0; | ||||
|     } | ||||
|     else | ||||
|     { | ||||
|         K = 1; | ||||
|     } | ||||
| 
 | ||||
|     //Ñòðîèì ãèñòîãðàììó
 | ||||
|     int cnt; | ||||
|     int bin_sz = bins.size(); | ||||
|     for (int i = 0; i < bin_sz; i++) | ||||
|     { | ||||
|         cout.width(3); | ||||
|         cout.fill(' '); | ||||
|         cout << bins[i] << "|"; | ||||
|         if (K == 0) | ||||
|             cnt = bins[i]; | ||||
|         else | ||||
|             cnt = bins[i] * (MAX_STR_LNG - PREFIX) / max_count; | ||||
| 
 | ||||
|         for (double j = 0; j < cnt; j++) { | ||||
|             cout << "*"; | ||||
|         } | ||||
|         cout << endl; | ||||
|     } | ||||
| } | ||||
| @ -0,0 +1,5 @@ | ||||
| #pragma once | ||||
| #include <vector> | ||||
| #define MAX_STR_LNG 80 | ||||
| #define PREFIX 4 | ||||
| void show_histogram_text(const std::vector<double>& bins); | ||||
					Загрузка…
					
					
				
		Ссылка в новой задаче