Question 3In the program below you will see that 6 random numbers in the range 1..49 arestored in the selected array before it is printed. No checking is done to see if thesame number occurs more than once Add the required checking and sort the numbers before you print them Could you think of a better strategy for generating the 6 different numbers? #include <stdio.h>#include <stdlib.h>#include <time.h> #define TOTAL_NUMBER 6void seed_generator(void);int get_rand_in_range(int from, int to); int main(void) { int i;int selected[TOTAL_NUMBER]; seed_generator(); for(i = 0; i < TOTAL_NUMBER; i++) selected[i] = get_rand_in_range(1, 49); for(i = 0; i < TOTAL_NUMBER; i++) printf("%i\t", selected[i]); printf("\n"); return 0; }int{get_rand_in_range(int from, int to)int min = (from > to) ? to : from;return rand() % abs(to - from + 1) + min;} void{seed_generator(void)time_t now;now = time(NULL);srand((unsigned)now);}
Question 3
In the program below you will see that 6 random numbers in the range 1..49 are
stored in the selected array before it is printed. No checking is done to see if the
same number occurs more than once
Add the required checking and sort the numbers before you print them
Could you think of a better strategy for generating the 6 different numbers?
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define TOTAL_NUMBER 6
void seed_generator(void);
int get_rand_in_range(int from, int to);
int main(void)
{
int i;
int selected[TOTAL_NUMBER];
seed_generator();
for(i = 0; i < TOTAL_NUMBER; i++)
selected[i] = get_rand_in_range(1, 49);
for(i = 0; i < TOTAL_NUMBER; i++)
printf("%i\t", selected[i]);
printf("\n");
return 0;
}
int
{
get_rand_in_range(int from, int to)
int min = (from > to) ? to : from;
return rand() % abs(to - from + 1) + min;
}
void
{
seed_generator(void)
time_t now;
now = time(NULL);
srand((unsigned)now);
}
srand() in C
Parameters is seed which is an integer value which might operate as the algorithm's seed for something like the pseudo-random number generator.
Return value is none.
With an argument called "random seed," the srand() function is utilized to initialize a series of pseudo-random numbers. It provides the rand function's output a random appearance. However, whatever time we execute the rand () function, the output will be identical.
rand() in C
- prototype for this function : int rand (void);
- It has no parameters
- An integer value between 0 and RAND MAX is the return value.
- The rand () function produces the best random integer in the series. The result is an integer that is pseudo-random and falls between 0 and RAND MAX.
- The default setting for the constant RAND MAX in the <cstdlib> header is 32767.
qsort() in C
The C library function void qsort(void *pointerbase, size_t N_items, size_t sizeArray, int (*compare_function)(const void *, const void*)) sorts an array.
Step by step
Solved in 3 steps with 1 images
