Skip to content

Instantly share code, notes, and snippets.

View ahmedshahriar's full-sized avatar
🏠
Working from home

Ahmed Shahriar Sakib ahmedshahriar

🏠
Working from home
View GitHub Profile
int searchBinary(int arrayList[],int findNum,int first , int last ){
while(first<=last){
int middle =( last+first)/2;
if(arrayList[middle]==findNum)
return middle;
int searchItem(int sist[],int item,int sizeList){
int position=0;
while(position<(sizeList-1)){
if(sist[position]==item){
break;
}else{
position++;}
}
return position;
}