forked from Abhinavmohanan/DS-College-Work
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmeanmedianmode.c
70 lines (60 loc) · 1.15 KB
/
meanmedianmode.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<stdio.h>
#include<stdlib.h>
void sort(int *a,int n)
{
int temp;
for(int i =0 ;i< n-1;i++)
{
for (int j = 0; j < n-i-1; j++)
{
if(a[j]>a[j+1])
{
temp = a[j];
a[j]=a[j+1];
a[j+1] = temp;
}
}
}
}
void main()
{
int a[100],mode,n,count,maxcount=0,i=0,j=0;
float mean,median;
printf("Enter no. of elements of array: ");
scanf("%d",&n);
printf("Enter elements of array: ");
for (int i = 0; i < n; i++)
{
scanf("%d",&a[i]);
mean += a[i];
}
mean /= n ;
sort(a,n);
if(n%2 == 0)
{
median = (float) ( a[(n/2)] + a[n/2 - 1])/ 2;
}
else
{
median = (a[n/2]);
}
while(i < n)
{
count =0;
while(j < n)
{
if(a[i] == a[j])
count++;
else
break;
j++;
}
if (maxcount < count)
{
maxcount = count;
mode = a[i];
}
i=j;
}
printf("Mean is %f \n Median is %f \n Mode is %d",mean,median,mode);
}