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 #include #include #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); }

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

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);
}

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY