# bMy Questions | bartlebyCourse Schedule - Fall 2 Xhttps://myleoonline.tamuc.edu/d2l/le/calendar/36472/event/125969/detailsview#125969TNUV 1Z, ZUI7 T.V TTTAdd a task...Fall 2019 - Programming Fundamentals II (COSC-1437-01E-02 B)In your program, you will randomly generate integer numbers between -50 and+50 (including -50 and +50). You will repeat this process 1000 times. Whilegenerating these numbers, you need to count the numbers based on their signsseparately, as positive and negative. For instance, if your program generate +2515 times, and -25 19 times. Then this should be reported as,Num PosFre NegFre251519For this problem, you need to use array of struct, similar to depicted below.NumberPosFreNegFreNumberPosFreNegFreNumberPosFreNegFreNegFreNumberPosFreReport all number from 1 to 50 in an ascending order. Note that you will not useany sort algorithm in this assignment.2:35 PMOType here to searchENG11/12/2019Xt bMy Questions | bartleby+Course Schedule - Fall 2 Xhttps://myleoonline.tamuc.edu/d2l/le/calendar/36472/event/125969/detailsview#125969NumberNegFrePosFreNumberPosFreNegFreNumberPosFreNegFreNumberPosFreNegFreReport all number from 1 to 50 in an ascending order. Note that you will not useany sort algorithm in this assignment.A sample output is given asNum PosFre NegFre1134554259163554354944295035692:36 PMOType here to searchENG11/12/2019XtLO

Question
Asked Nov 12, 2019
2 views

write a c++ program from the attachments below

check_circle

Step 1

Program:

#include <iostream>
#include <cstdlib>
#include <iomanip>

using namespace std;

struct number
{
int n;
int pos;
int neg;
};

int main()
{
struct number arr[100];

int r;

for(int i = 0; i<=50; i++)
{
arr[i].n = i;
arr[i].neg = 0;
arr[i].pos = 0;
}

for(int i = 0; i<1000; i++)
{

r = rand() % 101 - 50;

if(r < 0)
{
arr[abs(r)].neg = arr[abs(r)].neg + 1;
}
else
{
arr[r].pos = arr[r].pos + 1;
}
}

cout<<"Num"<<setw(10)<<"PosFre"<<setw(10)<<"NegFre"<<endl;

for(int j = 1; j<=50; j++)
{
cout<<arr[j].n<<setw(7)<<arr[j].pos<<setw(10)<<arr[j].neg<<endl;
}

return 0;
}

Output:

Num PosFre NegFre
1 8 11
2 4 8
3 10 10
4 8 12
5 9 4
6 5 12
7 14 12
8 10 5
9 14 10
10 9 10
11 12 17
12 11 10
13 11 13
14 12 8
15 11 12
16 10 8
17 9 12
18 8 11
19 10 10
20 10 8
21 14 8
22 9 11
23 9 11
24 3 9
25 11 13
26 13 11
27 19 8
28 11 6
29 6 8
30 9 8
31 13 11
32 7 10
33 13 6
34 10 8
35 6 11
36 9 12
37 12 11
38 6 7
39 11 9
40 4 17
41 8 11
42 8 16
43 8 14
44 13 6
45 9 14
46 9 11
47 15 9
48 5 10
49 8 7
50 12 15

Step 2
Step 3

### Want to see the full answer?

See Solution

#### Want to see this answer and more?

Solutions are written by subject experts who are available 24/7. Questions are typically answered within 1 hour.*

See Solution
*Response times may vary by subject and question.
Tagged in