Help starting program

[k1ckthem1dget]

I dont even know how to do this program can someone help me.

I am to create a program that when

(1) Given the following:

· A list of 11 integers; 1,2,3,3,3,2,2,1,3,4,5


(2) The program should:

· Creates an array from the source data list

· Determines the “mode” of the array (mode is a proper statistical term that is the value that occurs “most often”)

· The program should account for the “exception” that no “mode” occurs – no value in the array occurs more than once.


Any help is appreciated. Thanks

[DeMan]

What are the specific requirements?
Do we know there will always be exactly 11 integers (or at least is there a maximum number of integers we expect)?
Do these integers have a minimum and/or maximum value?
Are these integers stored in a file or do they get passed in throught the Standard Input (eg keyboard)?
Is there any suggestion as to what the expected result should be for your 'exception' (can we return any value or do we pick a specific one, or do we give an error)?
Repeat the above for the case where two or more integers share the lead for mode.

[Manjiri]

Try out this.... U will get the ans..
#include<stdio.h>

int main()
{
int i,j,k=1,p,a[20],b[20],n,cnt=1,big;
printf("Enter the maximum number of elements\n");
scanf("%d",&n);
printf("Enter the elements\n");
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
for(i=1; i<=n; i++)
{
for(j=i+1;j<=n; j++)
{
if(a[i]==a[j])
cnt++;
}
b[k]=cnt;
k++;
cnt=1;
}

big=b[1];
p=1;
for(i=2; i<=n; i++)
{
if(big<b[i])
{
big=b[i];
p=i;
}
}
printf("The element that occurs offenly is %d\n",a[p]);
printf("And it has occurred %d times\n",b[p]);
return 0;
}

[k1ckthem1dget]

My program just says to use appropriate console output to make the process user friendly.

[k1ckthem1dget]

Thank you very much majiri, but can you explain to me how u did it?? I would like to know how to do this myself for future programs. Thanks.

[Manjiri]

Thank you very much majiri, but can you explain to me how u did it?? I would like to know how to do this myself for future programs. Thanks.

See the logic is very simple.... U have to just go on checking for each element, how many times it has occured in the existing array....By comparing with other elements in the same array... And store that(The number of times that it has occured) in to other array...Store it in the respectve index only... Then now find out which is the big number in the second array.. fetch it's index value.. Now at the same index(In the first array) u will get that number which has occured oftenly.....

Thank you..
Hope you got it...

[k1ckthem1dget]

I think i followed that, thanks alot for your help.