-
Notifications
You must be signed in to change notification settings - Fork 1
/
binarySerch.c
66 lines (61 loc) · 1.13 KB
/
binarySerch.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
#include <stdio.h>
#define SIZE 5
int arr[SIZE];
void disp(void);
void insertionSort(void);
void search(int val);
int main()
{
printf("Hello, World!\n");
printf("Enter value\n");
for (int i = 0; i<SIZE; i++)
{
scanf("%d", &arr[i]);
//printf("%d\n", arr[i]);
}
insertionSort();
disp();
printf("Enter Value to serach\n");
int a;
scanf("%d", &a);
search(a);
return 0;
}
void disp(void){
for (int i = 0; i<SIZE; i++)
{
printf("%d\n", arr[i]);
}
}
void insertionSort(void){
for(int i = 1;i<SIZE;i++){
for(int j = 0;j<i;j++){
if(arr[j]>arr[i]){
int temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
}
}
void search(int val){
int mid;
int lb = 0;
int ub = SIZE -1;
while(lb<=ub){
mid = (lb+ub)/2;
if(val == arr[mid]){
printf("found %d at %d location\n", val,mid);
break;
}
else if(val<arr[mid]){
ub = mid-1;
}
else if(val>=arr[mid]){
lb = mid+1;
}
}
if(lb>ub){
printf("Not found");
}
}