-
Notifications
You must be signed in to change notification settings - Fork 0
/
Binary Search Along with Time complexity
125 lines (78 loc) · 1.89 KB
/
Binary Search Along with Time complexity
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
//Humza Khawar
//binary search
#include<stdio.h>
#include<ctype.h>
#include<time.h>
#include <string.h>
void ascending_sort();
int binarySearch(int, int, char*);
char Name_Array[50][20] = { 0 };
void main() {
int n = sizeof(Name_Array) / sizeof(Name_Array[0]);
int choice = 0;
char x[sizeof(Name_Array[0])];
for (int i = 0; i < 50; i++)
{
printf("\nEnter Name %d : ", i + 1);
scanf("%s", Name_Array[i]);
}
for (int i = 0; i < 50; i++)
{
for (int j = 0; j < 20; j++)
{
Name_Array[i][j] = toupper(Name_Array[i][j]);
}
}
ascending_sort();
printf("\nEnter Name to search: ");
scanf("%s", x);
for (int j = 0; j < sizeof(Name_Array[0]); j++)
{
x[j] = toupper(x[j]);
}
double begin = clock();
int result = binarySearch(0, n - 1, x);
double end = clock();
printf("\nName is at %d index.", result);
printf("\nTime measured: %f seconds.\n", (double)(end - begin)/ CLOCKS_PER_SEC);
}
void ascending_sort() {
for (int j = 0; j < 49; j++) {
for (int i = 0; i <49; i++)
{
if (strcmp(Name_Array[i], Name_Array[i + 1]) < 0)
{
continue;
}
else if (strcmp(Name_Array[i], Name_Array[i + 1]) > 0)
{
char temp_name[20];
strcpy(temp_name, Name_Array[i]);
strcpy(Name_Array[i], Name_Array[i + 1]);
strcpy(Name_Array[i + 1], temp_name);
}
}
}
}
int binarySearch(int l, int r, char x[sizeof(Name_Array[0])])
{
if (r >= l) {
int mid = l + (r - l) / 2;
// If the element is present at the middle
// itself
if ((strcmp(Name_Array[mid], x) == 0)) {
return mid;
}
// If element is smaller than mid, then
// it can only be present in left subarray
if ((strcmp(Name_Array[mid], x) > 0)) {
return binarySearch(l, mid - 1, x);
}
// Else the element can only be present
// in right subarray
return binarySearch(mid + 1, r, x);
}
// We reach here when element is not
// present in array
return -1;
}