Question

Develop an algorithm for finding the most frequently occurring value in an array of numbers. Use a sequence of coins. Place paper clips below each coin that count how many other coins of the same value are in the sequence. Give the pseudocode for an algorithm that yields the correct answer, and describe how using the coins and paper clips helped you find the algorithm. (C++)

Answer 1

PSEUDOCODE:

mostFrequency(a[],n)

{

hashmap freq; //we create a hashmap to store the frequency of each number, which will initially be 0.

for(i in 0 to n-1)

freq[a[i]]++; //updating frequency

maxCount=0,max=0;

for(i in freq)

{

if(i.second>maxCount) //comparing frequency to maximum

{

maxCount=i.second;

max=i.first;

}

}

return max;

}

Following is a code in C++ for finding the most frequently occurring value in an array of numbers:

#include <iostream>

#include <unordered_map>

#include <stdlib.h>

#include <time.h>

using namespace std;

//function to count frequency of each number in the array

//and return the number with most frequency

int mostFrequent(int a[],int n)

{

//map to store frequency

unordered_map<int,int> freq;

for(int i=0;i<n;i++)

freq[a[i]]++; //updating frequency

int maxCount=0,max=0; //temporary maximum

for(auto i:freq)

{

if(i.second>maxCount) //comparing frequency to maximum

{

maxCount=i.second;

max=i.first;

}

}

return max; //returning number with maximum frequency

}

int main()

{

//we create an array of size 100 randomly filled with 0-9

//to test the function

srand(time(0));

int a[100],i;

for(i=0;i<100;i++)

a[i]=rand()%10;

cout << mostFrequent(a,100);

}