summaryrefslogtreecommitdiffhomepage
path: root/misc/examples/gauss2.c
blob: 1ab8ade589870c7a1fbcb2dc6a947c579434a61e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <stdio.h>
#include <time.h>

#define i_implement
#include <stc/cstr.h>
#include <stc/crand.h>

// Declare int -> int sorted map.
#define i_key int
#define i_val int
#include <stc/csmap.h>

int main(void)
{
    enum {N = 5000000};
    uint64_t seed = (uint64_t)time(NULL);
    crand_t rng = crand_init(seed);
    const double Mean = round(crand_f64(&rng)*98.0 - 49.0), StdDev = crand_f64(&rng)*10.0 + 1.0, Scale = 74.0;

    printf("Demo of gaussian / normal distribution of %d random samples\n", N);
    printf("Mean %f, StdDev %f\n", Mean, StdDev);

    // Setup random engine with normal distribution.
    crand_norm_t dist = crand_norm_init(Mean, StdDev);

    // Create and init histogram map with defered destruct
    csmap_int hist = {0};
    cstr bar = {0};

    c_forrange (N) {
        int index = (int)round(crand_norm(&rng, &dist));
        csmap_int_insert(&hist, index, 0).ref->second += 1;
    }

    // Print the gaussian bar chart
    c_forpair (index, count, csmap_int, hist) {
        int n = (int)round((double)*_.count * StdDev * Scale * 2.5 / (double)N);
        if (n > 0) {
            cstr_resize(&bar, n, '*');
            printf("%4d %s\n", *_.index, cstr_str(&bar));
        }
    }
    cstr_drop(&bar);
    csmap_int_drop(&hist);
}