-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMean, median, mode calculator
98 lines (94 loc) · 1.68 KB
/
Mean, median, mode calculator
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include <stdio.h>
#include<math.h>
#include<stdlib.h>
#include<time.h>
#define SIZE 99
void sort(int data[]);
int mean(int data[]), mode(int data[]), median(int data[]);
void main()
{
int arr[SIZE], i, flag1, flag2, flag3;
void sort(arr);
srand(time(NULL));
for (i = 0; i < SIZE; i++)
{
arr[i] = 1 + rand() % 100;
}
printf("The generated array is:\n");
for (i = 0; i < SIZE; i++)
printf("%d\t\t", arr[i]);
printf("\n");
sort(arr);
printf("\nThe sorted array is:\n");
for (i = 0; i < SIZE; i++)
printf("%d\t\t", arr[i]);
flag1 = mean(arr);
flag2 = mode(arr);
flag3 = median(arr);
printf("\n\nThe mean of the values is: %d\nThe median of the values is: %d\nThe mode of the values is: %d", flag1, flag3, flag2);
}
void sort(int data[])
{
int i, j, temp, count;
for (i = 0; i < SIZE - 1; i++)
{
count = 0;
for (j = 0; j < SIZE - (1 + i); j++)
{
if (data[j] > data[j + 1])
{
temp = data[j];
data[j] = data[j + 1];
data[j + 1] = temp;
if (temp != data[j])
count++;
}
}
if (count == 0)
break;
}
}
int mean(int data[])
{
int i, sum=0, average;
for (i = 0; i < SIZE; i++)
sum = sum + data[i];
average = sum / SIZE;
return average;
}
int mode(int data[])
{
int i, j, count, t_count = 0, value;
for (i = 0; i < SIZE; i++)
{
count = 0;
for (j = i+1; j < SIZE; j++)
{
if (data[i] == data[j])
count++;
}
if (t_count < count)
{
t_count = count;
value = data[i];
}
}
if (t_count != 0)
return value;
}
int median(int data[])
{
int middle, i;
if (SIZE % 2 != 0)
{
i = ceil(SIZE / 2);
middle = data[i];
return middle;
}
else
{
i = SIZE / 2;
middle = ((data[i] + data[i-1]) / 2);
return middle;
}
}