-
Notifications
You must be signed in to change notification settings - Fork 0
/
client.c
123 lines (96 loc) · 3.04 KB
/
client.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
112
113
114
115
116
117
118
119
120
121
122
123
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include "header.h"
int main()
{
long int **arr;
arr=(long int **)calloc(10,sizeof(long int *));
for(int i=0;i<10;i++)
arr[i] = generate((i+1)*25000);
//Selection Sort
for(int i=0;i<10;i++)
{
clock_t t;
t = clock();
int n=(i+1)*25000;
unsigned long long comparisons = 0;
comparisons = SelectionSort(arr[i],n);
t = clock() - t;
double time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
FILE *fptr1 = fopen("selection_cmp.dat","a");
FILE *fptr2 = fopen("selection_time.dat","a");
fprintf(fptr1,"%d %llu\n",n,comparisons);
fprintf(fptr2,"%d %.3lf\n",n,time_taken);
fclose(fptr1);
fclose(fptr2);
}
free(arr);
arr=(long int **)calloc(10,sizeof(long int *));
for(int i=0;i<10;i++)
arr[i] = generate((i+1)*25000);
// Bubble Sort
for(int i=0;i<10;i++)
{
clock_t t;
t = clock();
int n=(i+1)*25000;
unsigned long long comparisons = 0;
comparisons = BubbleSort(arr[i],n);
t = clock() - t;
double time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
FILE *fptr1 = fopen("bubble_cmp.dat","a");
FILE *fptr2 = fopen("bubble_time.dat","a");
fprintf(fptr1,"%d %llu\n",n,comparisons);
fprintf(fptr2,"%d %.3lf\n",n,time_taken);
fclose(fptr1);
fclose(fptr2);
}
free(arr);
arr=(long int **)calloc(10,sizeof(long int *));
for(int i=0;i<10;i++)
arr[i] = generate((i+1)*25000);
//Quick Sort
for(int i=0;i<10;i++)
{
counter=0; //Global variable
clock_t t;
t = clock();
int n=(i+1)*25000;
unsigned long long comparisons = 0;
comparisons = quickSort(arr[i],0,n-1);
t = clock() - t;
double time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
FILE *fptr1 = fopen("quick_cmp.dat","a");
FILE *fptr2 = fopen("quick_time.dat","a");
fprintf(fptr1,"%d %llu\n",n,comparisons);
fprintf(fptr2,"%d %.3lf\n",n,time_taken);
fclose(fptr1);
fclose(fptr2);
}
free(arr);
arr=(long int **)calloc(10,sizeof(long int *));
for(int i=0;i<10;i++)
arr[i] = generate((i+1)*25000);
//Merge sort
for(int i=0;i<10;i++)
{
count1=0;
clock_t t;
t = clock();
int n=(i+1)*25000;
unsigned long long comparisons = 0;
comparisons = mergeSort(arr[i],0,n-1);
t = clock() - t;
double time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
FILE *fptr1 = fopen("merge_cmp.dat","a");
FILE *fptr2 = fopen("merge_time.dat","a");
fprintf(fptr1,"%d %llu\n",n,comparisons);
fprintf(fptr2,"%d %.3lf\n",n,time_taken);
fclose(fptr1);
fclose(fptr2);
}
free(arr);
printf("Execution successful!!!\n");
return 0;
}