Question

QUESTION 2 Write a program to generate N 20 random number in between 0 to N and [Q2] sort then descending [Q3jand ascending [Q4]Now define vector int> even to put the sorted evens [Q5]convert the sorted even in a range of 0 to 2*M_PI and print out their sind 1/ you might upload ans as different files or just one file Attach File Browse My Computer Browse Content Collection Browse Oropbox Click Save and Submit to save and submit. Click Save All Answers to save all ansur.

it is c++ for question 2 it has multiple parts

Answer 1

//SNAPSHOTS HAVE BEEN ATTACHED BELOW//

#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
#include <math.h>
#include <iostream>

#define _USE_MATH_DEFINES

using namespace std;

int main()
{
int l=0,n,i,j,temp;
vector <int> random_number;
n=20;//cout<<"Enter value of N: "; cin>>n;
for(i=1;i<=n;i++)
{ random_number.push_back(l+(rand()%20)); }

cout<<"\nRandom numbers are: \n";
for(i=0;i<n;i++)
cout<<random_number[i]<<" , ";

for (i = 0; i < n-1; i++) //BUBBLE SORT
{
for (j = 0; j < n-i-1; j++)
{
if (random_number[j] < random_number[j+1])
{
temp=random_number[j];
random_number[j]=random_number[j+1];
random_number[j+1]=temp;
}
}
}

cout<<"\n\nAfter Sorting in Descending order: \n";
for(i=0;i<n;i++)
cout<<random_number[i]<<" , ";

for (i = 0; i < n-1; i++)
{
for (j = 0; j < n-i-1; j++)
{
if (random_number[j] > random_number[j+1]) // Notice the only change here
{
temp=random_number[j];
random_number[j]=random_number[j+1];
random_number[j+1]=temp;
}
}
}

cout<<"\n\nAfter Sorting in Ascending order: \n";
for(i=0;i<n;i++)
cout<<random_number[i]<<" , ";

//By "sorted evens", I assume the even numbers among the list of random numbers generated earlier.
vector<int> even;
int count=0;

for(i=0;i<n;i++)
{
if(random_number[i]%2==0)
{
count++;
even.push_back(random_number[i]);}
}

cout<<"\n\nSorted even numbers are: \n";
for(i=0;i<count;i++)
cout<<even[i]<<" , ";

//cout<<M_PI; // That's the pi constant.
vector<int> new_range; //new range is 0 to 2*M_PI

cout<<"\n\nNew numbers ranged between (0,2*M_PI) are: \n";
for(i=0;i<count;i++)
{
temp=0+(((even[i]-0)*(2*M_PI-0))/(n-0));
//NewValue =NewMin + (((OldValue - OldMin) * (NewMax - NewMin)) / (OldMax - OldMin))

new_range.push_back(temp);
cout<<new_range[i]<<" , ";
}
cout<<"\n\nSine value of the even numbers ranged between (0,2*M_PI) are: \n";
for(i=0;i<count;i++)
{
cout<<sin(new_range[i])<<" , "; //sin function assumes degree as the unit of parameter
}
cout<<endl;

   return 0;
}

random_number_abc.cpp #include <stdio.h> #include <stdlib.h> #include <bits/stdC++.h> #include <math.h> #include <iostream> & 8 #define _USE_MATH DEFINES using namespace std; 10 11 12 int main() int l=0,n,i,j, temp; vector <int> random_number; n=20;//cout<<"Enter value of N: "; cin>>n; for(i=1;i<=n;i++) { random_number.push_back(l+(rand()%20)); } cout<<"\nRandom numbers are: \n"; for(i=0;i<n;i++) cout<<random_number[i]<<", "; for (i = 0; i < n-1; i++) // BUBBLE SORT for (j = 0; j <n-i-1; j++) if (random number[j] = random number[i+1]), temp=random_number[j]; random_number[j]=random_number[j+1]; random_number[j+1)=temp; cout<<"\n\nAfter Sorting in Descending order: \n"; for(i=0;i<n;i++) cout<<random_number[i]<<", "; for (i = 0; i < n-1; i++) for (j = 0; j < n-i-1; j++) if (random number[j] > random number[j+1]) // Notice the only change here

random_number_abc.cpp TUI (1=;1511;ITTI cout<<random_number[i]<<","; for (i = 0; i<n-1; i++) for (j = 0; j<n-i-1; j++) if (random number[j] > random number[j+1]) // Notice the only change here temp=random_number[j]; random_number[j]=random_number[j+1]; random_number[j+1]=temp; cout<<"\n\nAfter Sorting in Ascending order: \n"; for(i=0;i<n;i++) cout<<random_number[i]<<","; //By "sorted evens", I assume the even numbers among the list of random numbers generated earlier. vector<int> even; int count=0; for(i=0;i<n;i++) if(random_number[i]%2==0) count++; even.push back(random_number[i]); } cout<<"\n\nSorted even numbers are: \n"; for(i=0;i<count;i++) cout<<even[i]<<","; //fout<<M_PI; // That's the pi constant. vector<int> new_range; // new range is to 2*M_PI cout<<"\n\nNew numbers ranged between (0,2*M_PI) are: \n"; for(i=0;i<count;i++) temp=0+(((even[i]-0)*(2*M_PI-O)/(n-0)); //NewValue =NewMin + (((oldValue - OldMin) * (NewMax - Newmin)) / (OldMax - OldMin))

random_number_abc.cpp cout<<"\n\nSorted even numbers are: \n"; for(i=0;i<count;i++) cout<<even[i]<<", "; //cout<<M_PI; // That's the pi constant. vector<int> new_range; // new range is 0 to 2-M_PI cout<<"\n\nNew numbers ranged between (0,2*M_PI) are: in"; for(i=0;i<count;i++) temp=0+(((even[il-)*(2*M PI-O)/In-0). //NewValue =NewMin + ((oldValue - OldMin) * (NewMax - NewMin)) / (OldMax - OldMin)) new_range.push_back(temp); cout<<new_range[i]<<", "; cout<<"\n\nSine value of the even numbers ranged between (0,2-M_PI) are: \n"; for(i=0;i<count;i++) cout<<sin(new_range[i]]<<","; //sin function assumes degree as the unit of parameter return 0; 95 } 96 C++ - random_number_abc.cpp:75 Random numbers are: 3, 6, 17, 15 , 13, 15, 6, 12, 9, 1, 2, 7, 10, 19, 3, 6, 6, 6, 12, 16, After Sorting in Descending order: 19 , 17 , 16 , 15 , 15 , 13 , 12 , 12, 10, 9, 7, 6, 6, 6, 6, 3, 3, 2, 1, 0, After Sorting in Ascending order: 0, 1, 2, 3, 3, 6, 6, 6, 6, 7, 9, 10, 12, 12, 13, 15, 15, 16, 17, 19, Sorted even numbers are: 0, 2, 6, 6, 6, 6, 10, 12, 12, 16, New numbers ranged between (0,2*M_PI) are: 0,0,1,1,1,1, 3, 3, 3, 5, Sine value of the even numbers ranged between (0,2*MPI) are: 0, 0, 0.841471, 0.841471, 0.841471, 0.841471, 0.14112, 0.14112, 0.14112,-0.958924 [Finished in 1.335s]

Please upvote if it helped you or you have any doubt please comment below