Question

C++, THIS IS FOR AN UNSORTED ARRAY.

I'm trying to implement an "if" statement that will check if there are 2 or more modes in a data set. I tried checking "if (count == total)" then it would increment "pos" by 1 and put the other mode in the list (m[pos-1] = values[index]), but it kept giving me the same number multiple times. For instance, if the data set was {1,5,10,4,7,3,8,3,9,10} (the 3 and 10 occur twice) then i would get somewhere between 3 and 6 "10's" in the output for my mode. (std::sort and algorithm are off limits.)

void calcMode (int valuesll, int listlength) int pos1: int mlposl/vill hold mode int count # 1. //starts count at 1 int total = 1: //holds highest number off occurences for (int index - 0: index < listlength; index++) //iterates list for (int í = 1: íくlistlength; ǐ++) //iterates through list to compare values(index) to each Iteration of values [1] if (values [index] - values[i])//checks if equal to count occurences count++: //increments count else if (count > total) total-count; n(pos-1] = values [index] ; if (count < total) continue count = 1; cout << "Mode: "; for (int x- 0; x < pos: x++) cout << (m[pos-1]) <<""

Answer 1

//C++ program

#include <iostream>
using namespace std;

int main()
{
int i, j, sum = 0, n , k = 0, c = 1, max = 0, mode;
  
cout<<"Enter the length\n";
cin>>n;
int a[n] , b[n]={0};
  
cout<<"Enter the set of numbers\n";
for (i = 0; i < n; i++)
{
cin>>a[i];
}
for (i = 0; i < n - 1; i++)
{
mode = 0;
for (j = i + 1; j < n; j++)
{
if (a[i] == a[j]) {
mode++;
}
}
  
if ((mode > max) && (mode != 0)) {
k = 0;
max = mode;
b[k] = a[i];
k++;
}
  
else if (mode == max) {
b[k] = a[i];
k++;
}
  
}
  
for (i = 0; i < n; i++)
{
if (a[i] == b[i])
c++;
}
if (c == n)
cout<<"\nThere is no mode";
else
{
cout<<"\nMode\t= ";
for (i = 0; i < k; i++)
cout<<b[i]<<" ";
}
cout<<"\n";
return 0;
}

//sample output