-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySort.c
144 lines (107 loc) · 2.9 KB
/
BinarySort.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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
int N = 10;
//i1 <-> i2 position swap in "data" array
void swap(int* data, int i1, int i2) {
int temp = data[i1];
data[i1] = data[i2];
data[i2] = temp;
}
//Print the content of given array for debugging
void displayData(int* data) {
int i = 0;
printf("%d", data[0]);
for (i = 1; i < N; i++)
printf(", %d", data[i]);
printf("\n");
}
int findBitNo(int* data){
int tempBit = 31;
int i = 0;
while(true){
i=0;
while(i<N){
if((data[i] >> tempBit) & 1){
return ++tempBit;
}
i++;
}
tempBit--;
}
return ++tempBit;
}
//Perform binery sort
void binarySort(unsigned int* data, int bitNo, int lowerBound, int upperBound) {
int l_backup = lowerBound, u_backup = upperBound, i;
bool letsGo = false;
loopAgain:
//Scaning all the numbers between location "lowerBound" to "upperBound"
for (i = l_backup; i <= upperBound; i++) {
if ((data[i] >> bitNo) & 1) {
letsGo = true;
if (i != upperBound) {
swap(data, i, upperBound);
i--;
}
upperBound--;
}
}
if(!letsGo && bitNo > 0){
bitNo--;
goto loopAgain;
}
int hold = upperBound;
if (upperBound == u_backup)
hold = lowerBound;
else
hold = upperBound + 1;
//Again calling for divided subarry, and now for (bitNo - 1)th bit
if(bitNo > 0 && (hold != u_backup || lowerBound != upperBound)){
binarySort(data, (bitNo - 1), hold, u_backup);
binarySort(data, (bitNo - 1), lowerBound, upperBound);
}
}
int main(int argc, char* args[]) {
long startTime, endTime, time;
int lowerBound = 0, upperBound = 0, bitNo = __INTMAX_WIDTH__/2, i = 0;
unsigned int* data = NULL;
FILE* fptr = NULL;
int size; char fileName[20];
if(argc == 3){
size = atoi(args[1]);
strcpy(fileName, args[2]);
}
else{
size = 10000;
strcpy(fileName, "Data.txt");
printf("Default size:%d File name:%s!\n",size, fileName);
}
N = size;
data = (int*)malloc(sizeof(int)*N);
upperBound = N -1;
//READ from file to an array -----------------
fptr = fopen(fileName, "r");
if (fptr == NULL) { printf("File not found!!\n"); exit(1); }
while (fscanf(fptr, "%u", &data[i]) == 1) { i++; }
fclose(fptr);
//----------------------------------------
startTime = clock();
// bitNo = findBitNo(data); //Exteranal function to optimize bitNo
binarySort(data, bitNo-1, lowerBound, upperBound);
endTime = clock();
//WRITE data into file -------------------
char name[20]="Sorted_";
strcat(name, fileName);
fptr = fopen(name, "w");
for (i = 0; i < N; i++)
fprintf(fptr, "%u ", data[i]);
fclose(fptr);
//---------------------------------------
free(data);
time = (endTime - startTime) / CLOCKS_PER_SEC;
printf("%s file generated in %.3fs", name, time);
return 0;
}