Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions binit.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
#include<stdio.h>

int main(void){
int i,a[5],elem, t, start=0, end=5, mid;
printf("Enter elements for array\n");
for(i=0;i<5;i++){
printf("%d: ",i);
scanf("%d",&a[i]);
}
printf("Enter element to search: ");
scanf("%d",&elem);
while(start<=end){
mid=start+end/2;
if(elem==a[mid]){
printf("Element found at position: %d\n", mid);
return 0;
}else if(elem>a[mid])
start=mid;
else
end=mid;
}
printf("The element was not found\n");
return 0;
}
30 changes: 30 additions & 0 deletions binrec.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
#include<stdio.h>

int binsearch(int a[], int elem, int start,int end){
int mid = start + end / 2;
if(elem == a[mid])
return mid;
else if(start > end)
return -1;
else if(a[mid] > elem)
return binsearch(a,elem,start,mid);
else
return binsearch(a,elem,mid,end);
}

int main(void){
int i,a[5],elem, t;
printf("Enter elements for array\n");
for(i=0;i<5;i++){
printf("%d: ",i);
scanf("%d",&a[i]);
}
printf("Enter element to search: ");
scanf("%d",&elem);
t= binsearch(a,elem,0,5);
if(t==-1){
printf("Element not found\n");
}else
printf("The element was found at position: %d\n", t);
return 0;
}