Родитель
eff0c6a12c
Сommit
58bc515f9b
@ -1,8 +1,45 @@
|
||||
//
|
||||
// histogram.cpp
|
||||
// lab01
|
||||
//
|
||||
// Created by Светлана Рыбакова on 01.05.2025.
|
||||
//
|
||||
#include "histogram.h"
|
||||
#include <vector>
|
||||
|
||||
#include <stdio.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<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
|
||||
vector<size_t> bins(bin_count, 0);
|
||||
|
||||
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
|
||||
double bin_size = (max - min) / 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 + 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,16 @@
|
||||
//
|
||||
// histogram.h
|
||||
// lab01
|
||||
//
|
||||
// Created by Светлана Рыбакова on 01.05.2025.
|
||||
//
|
||||
|
||||
#ifndef histogram_h
|
||||
#define histogram_h
|
||||
|
||||
#include <vector>
|
||||
|
||||
std::vector<size_t>
|
||||
make_histogram(const std::vector<double>& numbers, size_t bin_count);
|
||||
|
||||
#endif /* histogram_h */
|
Загрузка…
Ссылка в новой задаче