I need help trying to match my output$($black$)$ with the correct output$($white$)$ using my code in C$.$

Primes.c

#include

#include

#include

#include "Primers.h$"$

int random$\_$in$\_$range$($int lower$\_$bound, int upper$\_$bound$)$

$\{$

return $(($rand$()\%($upper$\_$bound $-$ lower$\_$bound$))+$ lower$\_$bound$)$;

$\}$

void populate$($int $*$arr$,$ int size, int lower$\_$bound, int upper$\_$bound$)$

$\{$

for$($int i$=0$; i max$)\{$

max $=$ curr;

$\}$

$\}$

return max;

$\}$

float get$\_$running$\_$ratio$()$

$\{$

float sumRatio $=0$;

int maxPrimes $=0$;

int iteration$\_$number $=1$;

int num$\_$iteration $=$ random$\_$in$\_$range$(50,100)$;

for $($int j $=0$; j $$ num$\_$iteration; j$++)$

$\{$

int size $=$ random$\_$in$\_$range$(150,201)$;

char $*$arr $=($char $*)$malloc$($sizeof$($char$)*$ size$)$;

for $($int i $=0$; i $$ size; i$++)$

$\{$

arr$[$i$]=$ random$\_$in$\_$range$(50,200)$;

$\}$

int primeCount $=$ get$\_$prime$\_$count$($arr$,$ size$)$;

float ratio $=($float$)$primeCount $/($float$)($size $-$ primeCount$)$;

sumRatio $+=$ ratio;

if $($maxPrimes $$ primeCount$)$

$\{$

maxPrimes $=$ primeCount;

iteration$\_$number $=$ j;

$\}$

free$($arr$)$;

$\}$

printf$("[$Primes$]$: Number of iterations is: $\%$d

$",$ num$\_$iteration$)$;

printf$("[$Primes$]$: Iteration with MAX prime count: $\%$d

$",$ iteration$\_$number$)$;

return $($sumRatio $/$ num$\_$iteration$)$;

$\}$

Drivers.c

#include "Primes.c$"$

#include

#include

int main$($int argc, char$**$argv$)$

$\{$

int seed $=0$;

if $($argc $>1)\{$

seed $=$ atoi$($argv$[1])$;

$\}$ else$\{$

seed $=1000$;

$\}$

printf$("[$Driver$]$: Seeding RNG with seed: $\%$d

$",$ seed$)$;

srand$($seed$)$;

float avgRatio $=$ get$\_$running$\_$ratio$(0)$;

printf$("[$Driver$]$: Average prime$/$composite ratio: $\%$f

$",$ avgRatio$)$;

return EXIT$\_$SUCCESS;

$\}$