# Finding the mode in a array

Hi Experts,

I hace this program that I've been working on for several hours now and just can't figure out how to
find the mode in the array. I can display the average, total, and median, but just can't seem to code
correctly for the mode of the values.

Can someone please show me a code sample using my program of how it's done.

The program is used to gather statistical data for a survey about the number of movies college students see in a month.

Thanks for your help guys.

###### Who is Participating?

Commented:
What is happening is that you declared the function to return a float, but you are returning 0, which is a constant. So the constant is considered a double, and when casting a double to a float (since you are returning a float) you get that warning, since a double uses  64 bits and and float only 32 bits.

Since your array contains only ints, you should return an int:

int findMode(const int array[], int elems)

and then return the mode that you have found, instead of 0:

return mode;

If you still want a float returned, you can still do

return mode;

or cast it to make it explicit that this is what you want:

return (float) mode;

0

Author Commented:
I forgot to to show my program:

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

void readem(int * & number, int &quant)
//          OUT             OUT
// This function reads the data and returns it in an array along with
// the quantity of elements read.
{
// Find out how many numbers there will be and allocate space
cout << "\nHow many students took the survey? ";
cin >> quant;

// Allocate appropriate amount of space
number = new int[quant];

// Read numbers and put them into list
for(int i=0; i<quant; i++)
{
cout << "\nNumber of movies for student # " << i+1 << "? ";
cin >> number[i];
}

return;
}

int sum(const int array[], int num)
//      IN                 IN
// This function calculates the sum of the array with 'num' elements.
{
int total=0;

for(int i=0; i < num; i++)
total += array[i];

}

float median(const int array[], int num)
//           IN                 IN
// This function calculates the average, or geometric mean of the array.
// The array contains 'num' elements.  NOTE: no error checking is done.
// If the array has an odd number of elements the median is the element in
// the middle position; otherwise it is the average of the two elements
// closest to the middle.
{
float middle;

if ( (num % 2) == 1)
middle = float(array[num/2]);
else
middle = (array[num/2] + array[num/2 - 1]) / 2.0;

return middle;
}

int main()
{
int * number;  //Pointer to array to hold values
int num = 0;       //Quantity of values read
int total;

// Read data and store in array

// Call functions to get mean and median and display results.

total = sum(number, num);

cout  << "\nSum = " << total << endl;
cout << "\nAverage = " << float(total)/num << endl;
cout << "\nMedian  = " << median(number, num) << endl;

// Return space to free store
delete[] number;

return 0;
}
0

Commented:
Your program seems to be assuming the array is sorted (otherwise your median function is incorrect).

So, if it is sorted, walk through the whole array and count how many times a number repeats (that is, the same number is in two of more consecutive array locations). Keep track of which number has repeated the most, that is the mode.

Full code cannot be provided as this is clearly homework, however if you post your attempt we can help you fix any problems.

0

Commented:
Note, if the array is not sorted, you should sort it before calculating the mode and median. Look up a bubble sort for an easy way to sort.
0

Commented:
>>>> Your program seems to be assuming the array is sorted

The array isn't sorted cause the values must be entered by the user in main().

You can sort the array after it is entered by using std::vector and std::sort:

#include <vector>
#include <algorithm>

// put your array to a std::vector
std::vector<int> v(&number[0], &number[quant]);

std::sort(v.begin(), v.end());

If the array is sorted you easily can determine the mode iterating the array and counting the longest sequence of equal numbers.

Regards, Alex

0

Author Commented:
Hi again experts!

I made changes to my program using samples from the book, but when I added the findMode (function) i got errors when compiling. Such as  float to int, possible loss of data, a a couple other can you please tell me what I need to change to get this working.

Thank you all for your help on this.
0

Author Commented:
Here is the program again with the changes:

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

void readem(int * & number, int &quant)
//          OUT             OUT
// This function reads the data and returns it in an array along with
// the quantity of elements read.
{
// Find out how many numbers there will be and allocate space
cout << "\nHow many students took the survey? ";
cin >> quant;

// Allocate appropriate amount of space
number = new int[quant];

// Read numbers and put them into list
for(int i=0; i<quant; i++)
{
cout << "\nNumber of movies for student # " << i+1 << "? ";
cin >> number[i];
}

return;
}

int sum(const int array[], int num)
//      IN                 IN
// This function calculates the sum of the array with 'num' elements.
{
int total=0;

for(int i=0; i < num; i++)
total += array[i];

}

float median(const int array[], int num)
//           IN                 IN
// This function calculates the average, or geometric mean of the array.
// The array contains 'num' elements.  NOTE: no error checking is done.
// If the array has an odd number of elements the median is the element in
// the middle position; otherwise it is the average of the two elements
// closest to the middle.
{
float middle;

if ( (num % 2) == 1)
middle = float(array[num/2]);
else
middle = (array[num/2] + array[num/2 - 1]) / 2.0;

return middle;
}

void sortArray(int array[], int elems)
{
int temp;
bool swap;

do
{
swap = false;
for (int count = 0; count < (elems - 1); count++)
{
if (array[count] > array[count +1])
{
temp = array [count];
array[count] = array[count+1];
array[count +1] = temp;
swap = true;
}
}
} while (swap);
}

float findMode(float *array, int elems)
{
int lastnum = array[0];
int curlen = 1;
int mode = array[0];
int modelen = 1;
for(int i = 1; i < elems; i++)
{
if (array[i] == lastnum)
curlen++;
else
{
if (curlen > modelen)
{
modelen = curlen;
mode = lastnum;
}
lastnum = array[i];
curlen = 1;
}
}

return ;
}

int main()
{
int * number;  //Pointer to array to hold values
int num = 0;       //Quantity of values read
int total;

// Read data and store in array

// Call functions to get mean and median and display results.

total = sum(number, num);

sortArray(number, num);

cout  << "\nSum = " << total << endl;
cout << "\nAverage = " << float(total)/num << endl;
cout << "\nMode = " << findMode (number, num) << endl;
cout << "\nMedian  = " << median(number, num) << endl;

// Return space to free store
delete[] number;

return 0;
}
0

Commented:
float findMode(float *array, int elems)
{
int lastnum = array[0];   <---------------- your array holds floats, so you should declare lastnum as a float
int curlen = 1;
int mode = array[0];      <---------------- same here
int modelen = 1;
for(int i = 1; i < elems; i++)
{
if (array[i] == lastnum)
curlen++;
else
{
if (curlen > modelen)
{
modelen = curlen;
mode = lastnum;
}
lastnum = array[i];
curlen = 1;
}
}

return ; <----------------------------- your function is declared as returning a float, so you must return something here.
}
0

Commented:
Actually I have it backward.

Your input is stored in an array of ints,so that is what you must pass into the findMode function:

float findMode(float *array, int elems)  <------------ pass in an integer array like in the sum function
{
int lastnum = array[0];
int curlen = 1;
int mode = array[0];
int modelen = 1;
for(int i = 1; i < elems; i++)
{
if (array[i] == lastnum)
curlen++;
else
{
if (curlen > modelen)
{
modelen = curlen;
mode = lastnum;
}
lastnum = array[i];
curlen = 1;
}
}

return ; <------------------------- return the mode as the output
}
0

Author Commented:
I did as you said:

float findMode(const int array[], int elems)
{
int lastnum = array[0];
int curlen = 1;
int mode = array[0];
int modelen = 1;
for(int i = 1; i < elems; i++)
{
if (array[i] == lastnum)
curlen++;
else
{
if (curlen > modelen)
{
modelen = curlen;
mode = lastnum;
}
lastnum = array[i];
curlen = 1;
}
}

return 0;
}

But as I compile, I get this error:

: warning C4244: '=' : conversion from 'double' to 'float', possible loss of data
0

Author Commented:
Thanks Wayside so much.

It worked perfectly. I gave you 480 points and I gave the other person 20 points for trying to help me also, I hope that's okay?
I try to be fair.

I appreciate your help and maybe I'll continue getting help from you since I have a couple of small projects I want to work on this week to continue learning.

Thanks again.
0

Commented:
Glad I could help!
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.