Binary search Program In c | How to implement binary search in c

#include<stdio.h>
//global declaractions
int a[5],n=5,i;
 
 
void ArrIn();
void Binary();
int main(){
 
	ArrIn();
 
 
    Binary();
 
    return 0;
}
void ArrIn(void){
	for(i=0;i<n;i++){
    	printf("\nEnter %d element ",i+1);
    	scanf("%d",&a[i]);
	}
}
 void Binary(){
    int lb=1,ub=n,mid,find;
printf("\n Enter element which you want to find");
    scanf("%d",&find);
 
	 while(lb<=ub){
	        mid=(lb+ub)/2;
	        if(find<mid){
	               ub=mid-1; 
	        }
	        else if(find>mid){
	            lb=mid+1;
	        }
	        else if(find==mid){
	        	printf("\nElement found");
	        	break;
			}
 
	    }
	if(find!=mid){
		printf("\nElement not found");
	}
}
 
ALGORITHM
STEP 1:
    Read shorted a[n]
    initialize lb<-1,ub<-n
STEP 2:
    Repeat while lb<=ub
        mid<-(lb+ub)/2
          if(x<mid)
            then 
                ub<-mid-1
           else if(x->mid)
             then
                lb<-mid+1
            else
                write "yes" or return mid
           end if
        end else if
    end while

STEP 3:

Write a[n]

Output