Question

language: C++

creat a program that:

Q5 10 Pts) output the numbers below using the one that occurs must frequently first Most Frequently({3,4,1,1,1},5) => 1113 4 void MostFrequently(const int* nums, int size) { } I

Answer 1

CODE:

#include <iostream>

using namespace std;

void MostFrequently(const int *nums,int size){
//int array to store the numbers in row 1 and their
//frequency in row 2
int freq[size][2];
//initializing the freq array
for(int i=0;i<size;i++){
freq[i][0] = 0;
freq[i][1] = 0;
}
//n is the number of unique numbers in the array
int n = 0;
//calculating the frequency of each number in the array
for(int i=0;i<size;i++){
int num = nums[i];
int f = 0;
for(int j = i;j<size;j++){
if(nums[j] == num){
f++;
}
}
//searching the freq array if num is present in it or not
int found = 0;
for(int k=0;k<n;k++){
if(num == freq[k][0]){
found = 1;
break;
}
}
//if it is not present already only then it will be added to
//the array freq to avoid duplication
if(found != 1){
freq[n][0] = nums[i];
freq[n][1] = f;
n++;
}
}
//sorting the freq array with respect to the frequency
for(int i=0;i<n;i++){
//sorting using selection sort in descending order
int max = freq[i][1];
int maxIndex = i;
for(int j=i;j<n;j++){
if(freq[j][1] >= max){
max = freq[j][1];
maxIndex = j;
}
}
//swapping the array numbers
int tempNum = freq[i][0];
int tempFreq = freq[i][1];
freq[i][0] = freq[maxIndex][0];
freq[i][1] = freq[maxIndex][1];
freq[maxIndex][0] = tempNum;
freq[maxIndex][1] = tempFreq;
}
//using the freq array
for(int i=0;i<n;i++){
//to print the numbers in the frequency times in descending order
int num = freq[i][0];
for(int j=0;j<freq[i][1];j++)
cout<<num<<" ";
}
cout<<endl;
}

//main method
int main() {
//input array
int arr[] = {3,4,1,1,1};
//calling the function
cout<<"OUTPUT:"<<endl;
MostFrequently(arr,5);
return 0;
}

____________________________________________

CODE IMAGES:

- jhvhm.cpp - Code::Blocks 17.12 Eile Edit View Search Project Build Debug Fortran wxSmith Tools Tools+ Plugins DoxyBlocks Settings Help X <global main() : int Q QSC Start here x jhvhm.cpp x ios_base.h X #include <iostream> 1 2 3 using namespace std; 4 5 6 7 8 9 void Most Frequently(const int *nums, int size) { Mint array to store the numbers in row i and their //frequency in row 2 int freq[size] [2]; //initializing the freq array for(int i=0;i<size;i++) { freq[i][0] = 0; freq[i][1] = 0; } 10 11 12 13 14 15 16 17 18 19 //n is the number of unique numbers in the array int n = 0; //calculating the frequency of each number in the array for (int i=0;i<size;i++) { int num = nums[i]; int f = 0; for(int j = i;j<size; j++) { if (nums [j] == num) { f++; 1 1 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 // searching the freg array if mwm is present in it or not int found = 0; for (int k=0; k<n; k++) { if (num == freq[k][0]) { found = 1; break; } //if it is not present already only then it will be added to //the array freg to avoid duplication if (found != 1) { freq[n][0] = nums[i]; freq[n][1] = f;

- jhvhm.cpp - Code::Blocks 17.12 Eile Edit View Search Project Build Debug Fortran wxSmith Tools Tools+ Plugins DoxyBlocks Settings Help X <global Most Frequently(const int* nums, int size) : void Q QSC Start here 43 44 45 46 47 48 x jhvhm.cpp x ios_base.h х //sorting using selection sort in descending order int max = freq[i] [1]; int maxIndex = i; for(int j=i;j<n; j++) { if(freg[j][1] > max) { max = fregij][1]; max Index = j; } Y swapping the array numbers 50 51 52 53 54 55 56 int tempNum = freq[i][0]; int temp Freq = freq[i][1]; freq[i][0] = freg(maxIndex] [0]; freg[i][1] = freg[max Index] [1]; freg(maxIndex][0] = tempNum; freq[maxIndex] [1] = temp Freq; 57 58 59 60 61 } 62 //using the freg array for (int i=0;i<n;i++) { //to print the numbers in the frequency times in descending order int num = freg[i][0]; for(int j=0; j<freq[i][1]; j++) cout<<num<<" "; 63 64 65 } cout<<endl; :] 66 67 68 69 70 71 72 73 74 75 76 77 78 79 //main method int main() { //input array int arr[] = {3,4,1,1,1); // calling the function cout<<"OUTPUT:"<<endl; Most Frequently (arr, 5); return 0; 1

- jhvhm.cpp - Code::Blocks 17.12 Eile Edit View Search Project Build Debug Fortran wxSmith Tools Tools+ Plugins DoxyBlocks Settings Help X <global Most Frequently(const int nums, int size) : void Q QSC Start here 37 38 39 x jhvhm.cpp X ios_base.h х freg(n) [1] = f; n++; } 3 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 // sorting the freg array with respect to the frequency for(int i=0;i<n;i++) { //sorting using selection sort in descending order int max = freq[i] [1]; int maxIndex = i; for(int j=i;j<n; j++) { if (freg() [1] > max) { max = fregij][1]; max Index = j; } 1 // swapping the array numbers int tempNum = freq[i][0]; int temp Freq = freq[i] [1]; freq[i][0] = freq[maxIndex][0]; freq[i][1] = freg(maxIndex] [1]; freg(max Index][0] = tempNum; freg[maxIndex] [1] = tempFreq; 56 57 58 59 60 61 } //using the freq array for (int i=0;i<n;i++) { //to print the numbers in the frequency times in descending order int num = freq[i][0]; for(int j=0; j<freq[i] [1] ; j++) cout<<num<<" "; } cout<<endl; 62 63 64 65 66 67 68 69 70 71 72 73 :) //main method int main() { //input array int arr[] = {3,4,1,1,1);

__________________________________________________

OUTPUT:

- х C:\Users\Win10\Documents\jhvhm.exe OUTPUT: 1 1 1 34 execution time : 0.141 s Process returned o (0x0) Press any key to continue.

________________________________________________

Feel free to ask any questions in the comments section

Thank You!