-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmedian_of_medians.c
111 lines (96 loc) · 2.37 KB
/
median_of_medians.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
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
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
// Median of Median approach taking 3,5,7,9... elements in each group
#define MAX 100
#define ROUNDS 12
void insertion_sort(int *arr, int start, int final){
for (int i = start; i <= final; i++){
int temp = arr[i];
int pos = i - 1;
while (pos >= start && arr[pos] > temp){
arr[pos + 1] = arr[pos];
pos--;
}
arr[pos + 1] = temp;
}
}
int median(int *arr, int start, int final){
insertion_sort(arr, start, final);
int mid = (start + final) / 2;
return arr[mid];
}
int median_of_medians(int *arr, int size, int div_size){
if (size < div_size){
return median(arr, 0, size - 1);
}
int total = size / div_size;
int last = size % div_size;
int next;
if (last == 0){
next = total;
}
else{
next = total + 1;
}
int next_arr[next];
for (int i = 0; i < next; i++){
if (i == next - 1){
next_arr[i] = median(arr, div_size * i, size - 1);
}
else{
next_arr[i] = median(arr, div_size * i, div_size * (i + 1) - 1);
}
}
return median_of_medians(next_arr, next, div_size);
}
int main(){
//srand(time(0));
int size = 1000;
int partition_size;
int arr[size];
int copy[size];
printf("Choose file for data(eg. normal.txt):");
char data_file[100];
gets(data_file);
printf("Choose file for result(eg. mom_result.txt):");
char result_file[100];
gets(result_file);
FILE *file=fopen(data_file, "r");
int num;
for(int i=0;i<size;i++){
fscanf(file,"%d", &num);
arr[i]=num;
}
for(int i=0;i<size;i++){
printf("%d ", arr[i]);
}
int mid=median(arr,0,size);
FILE *f2 = fopen(result_file,"a");
fprintf(f2,"Partition_size,Diff_median_MoM\n");
for(int k=0;k<=14;k++){
partition_size= 2 * k + 3;
int m=0;
int diff=0;
for (int j = 0; j < 1000; j++){
for (int i = 0; i < size; i++){
copy[i] = arr[rand()%size];
}
m=m+median_of_medians(copy, size, partition_size);
diff=diff+abs((mid-median_of_medians(copy, size, partition_size)));
}
m=m/1000;
diff=diff/1000;
printf("%d ", diff);
//fprintf(f1, "%d,%d,%d",partition_size, mid,m);
fprintf(f2, "%d,%d",partition_size, diff);
//fprintf(f1,"\n");
fprintf(f2,"\n");
}
printf("File has been generated successfully\n");
//fclose(f1);
fclose(f2);
fclose(file);
return 0;
}