Finding Mode in an Array

[cluterbug1]

I seem to keep running into problems trying to figure out how to get the mode... Any help please!!

    #include <ctime>
#include <iostream>
#include <cstdlib>
#include <iomanip>
using namespace std;


int Number_Generat();
int sum(int temp_Array[50]);
int mean(int temp_Array[50]);
int largest(int temp_Array[50]);
int smallest(int temp_Array[50]);


int main() {


srand (time(NULL));

int my_Array[50];
int i;

for(i=0;i<50;i++)
{
my_Array[i]= Number_Generat();
cout<<my_Array[i]<<" ";

}


int total = sum(my_Array);
int nmean = mean(my_Array);
float nmode = mode(my_Array);
int large = largest(my_Array);
int small = smallest(my_Array);



cout<<"\nSum is: "<<total<<endl; 
cout<<"Mean is: "<<nmean<<endl;
cout<<"Mode is: "<<nmode<<endl;
cout<<"Largest is: "<<large<<endl;
cout<<"Smallest is: "<<small<<endl;


return 0;
}


int Number_Generat()
{
int num = 0;
num = rand()%26;
return num;
}


int sum(int temp_Array[50])
{
int total=0;
for(int i=0; i<50;i++)
{
total = total+temp_Array[i];
}
return total;
}


int mean(int temp_Array[50])
{
int mean = sum(temp_Array)/50;
return mean;
}

int mode(int temp_Array[50])
{


}

int largest(int temp_Array[50])
{
int tmp=temp_Array[0];
for(int i =1;i<50;i++)
{
if(temp_Array[i] >tmp)
tmp = temp_Array[i];
}

return tmp;
}


int smallest(int temp_Array[50])
{
int tmp=temp_Array[0];
for(int i =1;i<50;i++)
{
if(temp_Array[i] < tmp)
tmp = temp_Array[i];
}

return tmp;
}

[j3Rz8vqX]

The mode is the number that is repeated more often than any other

http://www.purplemath.com/modules/meanmode.htm

Loop through the array.
Have an array to manage unique values.
Have another array to manage how often they were present.

If value present in the array, managing the number of counted, is 1 or less, and original array was greater than 1 then there was no mode? (Not a disciple of math here, but every number would've been unique if that happened).

Have fun.

[rich1]

you can try to sort values in the array and then go through the array counting how many times the same value appears...
1. sort
1 2 8 2 8 3 1 1 8 8 ---> 1 1 1 2 2 3 8 8 8 8

2. counting
1 1 1 --- > 3x *(this could be the mode)
2 2 --- > 2x (2 < 3, so this is not the mode)
3 --- > 1x (1 < 3, so this is not the mode)
8 8 8 8 -> 4x *(4 > 3, we found the mode)

* you can make a check if the number of how many times the same value occurs is not bigger then the number of values left

[cluterbug1]

Do you have like an example of some code I could see... Im sorry but Im really having a lot of trouble with this..

[cluterbug1]

Thanks...

[eyenrique]

Hi @cluterbug1,
this could be
a start

//Mode.cpp
//##

#include <iostream>
using std::cout;
using std::endl;

bool isNotRepeated(int const key,int array[],int const SIZE,int position);
void printArray(int array[],int const SIZE);


int main(){

	int const SIZE=10;
	int setOfNumbers[SIZE]={0,5,3,0,5,6,7,7,8,0};
	int ocurrences[SIZE]={}; //all of them start at 0 -zero-


	//finding ocurrences
	for(int i=0;i<SIZE;i++){
		for(int j=0;j<SIZE;j++){
			if(setOfNumbers[i]==setOfNumbers[j])
				ocurrences[i]++;
		}//end inner for
	}//end outer for

	//print array
	cout<<"\nSet of numbers:\n";
	printArray(setOfNumbers,SIZE);

	cout<<endl;

	cout<<"Ocurrences\n"<<endl;
	for(int i=0;i<SIZE;i++){
		if(ocurrences[i]>1&&isNotRepeated(setOfNumbers[i],setOfNumbers,SIZE,i))
		cout<<"Number "<<setOfNumbers[i]<<" - "<<ocurrences[i]<<endl; 
	}//end for
	

return 0; //indicates success
}//end of main

bool isNotRepeated(int const key,int array[],int const SIZE,int position){

	int counter=0;
	for(int i=0;i<position;i++){
		if(key==array[i])
			++counter;
	}//end for
	if(counter>=1)
		return false;

return true;
}//end function isNotRepeated

void printArray(int array[],int const SIZE){
	for(int i=0;i<SIZE;i++){
		cout<<array[i]<<((i+1)%5==0?'\n':' ');
	}//end for

}//end function printArray 

Set of numbers:
0 5 3 0 5
6 7 7 8 0

Ocurrences

Number 0 - 3
Number 5 - 2
Number 7 - 2