cs-lab34/histogram.cpp

#include <iostream>
#include <conio.h>
#include <vector>
#include "histogram.h"
using namespace std;

void find_minmax(const vector<double>& numbers, double& min, double& max) {
    if (numbers.size() != 0)
    {
        min = numbers[0];
        max = numbers[0];
        for (double x : numbers)
        {
            if (x < min)
            {
                min = x;
            }
            if (x > max)
            {
                max = x;
            }
        }
    }
}

vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count)
{
    double min_number, max_number;
    find_minmax(numbers, min_number, max_number);
    vector<size_t> bins(bin_count);
    for (int i = 0; i < bin_count; i++)
    {
        bins[i] = 0;
    }
    double bin_size = (max_number - min_number) / 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_number + j * bin_size;
            auto hi = min_number + (j + 1) * bin_size;
            if ((lo <= numbers[i]) && (numbers[i] < hi))
            {
                bins[j]++;
                found = true;
            }
        }
        if (!found)
        {
            bins[bin_count - 1]++;
        }
    }
    return bins;
}