-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBinary_src_updated.c
63 lines (57 loc) · 1.22 KB
/
Binary_src_updated.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
/*
Author : Simanta Kumar Roy
Daffodil International University
221-35-909
roy35-909@diu.edu.bd
*/
#include<stdio.h>
int main()
{
int n,s;
printf("What is your Array Size : ");
scanf("%d",&n);
int arr[n];
printf("\n");
for(int i=0;i<n;i++)
{
printf("Enter Element for this Array [%d] = ",i);
scanf("%d",&arr[i]);
printf("\n");
}
for(int i=0;i<n;i++)
printf("%d ",arr[i]);
for (int c = 0 ; c < n - 1; c++)
{
for (int d = 0 ; d < n - c - 1; d++)
{
if (arr[d] > arr[d+1])
{
int swap = arr[d];
arr[d] = arr[d+1];
arr[d+1] = swap;
}
}
}
printf("\n");
for(int i=0;i<n;i++)
printf("%d ",arr[i]);
int min = 0,max = n-1;
printf("\nEnter a Element for src : ");
scanf("%d",&s);
while(1)
{
int mid = (min+max)/2;
if(arr[mid]!=s&&min>=max){
printf("\n Not Found !!");
break;
}
if(arr[mid]==s){
printf("\n %d ",mid);
break;
}
else if(arr[mid]<s)
min = mid+1;
else if(arr[mid]>s)
max = mid-1;
}
}