Родитель
e30ff78007
Сommit
123602babe
@ -0,0 +1,34 @@
|
||||
static void
|
||||
find_minmax(const std::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;
|
||||
}
|
||||
}
|
||||
|
||||
std::vector <size_t>
|
||||
make_histogram(const std::vector<double>& numbers, size_t bucket, size_t number_count) {
|
||||
std::vector <size_t> stolb(bucket);
|
||||
double min, max;
|
||||
find_minmax (numbers, min, max);
|
||||
float k = (max-min)/bucket;
|
||||
for (size_t i = 0; i < bucket; i++) stolb[i] = 0;
|
||||
for (size_t i = 0; i < number_count; i++)
|
||||
{
|
||||
bool flag = false;
|
||||
for (size_t j = 0; (j < bucket && !flag); j++)
|
||||
{
|
||||
if (numbers[i] >= (min+k*j) && numbers[i] < (min+k*(1+j)))
|
||||
{
|
||||
stolb[j]++;
|
||||
flag = true;
|
||||
|
||||
}
|
||||
}
|
||||
if (!flag) stolb[bucket-1]++;
|
||||
}
|
||||
return stolb;
|
||||
}
|
Загрузка…
Ссылка в новой задаче