DAA LAB Roll no: 1702688

Practical : 5

Aim: To calculate mean ,median and mode

Algorithm:
MMM( array , size )
1. Calculate sum of all the elements of the array.
2 Divide the sum by size of array
3 Mean = sum/size of array
4 If size is even then
median is arr[size/2]
else
median is (arr[(size-1)/2] + arr[size/2] ) / 2.0;
5 Set counter for each element in array
6 Maximum the count for which value that's the mode.
7 End

Program :
# include <iostream>
using namespace std;
double findMean(int a[], int n)
{
int sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
return (double)sum/(double)n;
}
double findMedian(int a[], int n)
{
if (n % 2 != 0)
return (double)a[n/2];
return (double)(a[(n-1)/2] + a[n/2])/2.0;
}

int main()
{
int a[] = { 1,5,8,14,19,19,20};
int n = sizeof(a)/sizeof(a[0]);
cout << "Mean = " << findMean(a, n) << endl;
cout << "Median = " << findMedian(a, n) << endl;

Page no: 8
DAA LAB Roll no: 1702688

int max=0;
for(int i=0;i<n;i++)
{ if(max<a[i])
max=a[i];
}
int count[max+1]={};
for(int i=0;i<n;i++)
count[a[i]]++;
int mod=0;
for(int i=0;i<=max;i++)
{ if(count[mod]<count[i])
mod=i; }
cout<<"Mode = "<<mod<<endl;
return 0;
}

Output:

Page no: 9