Iterative binary search int bsearch(int* al int size, int x) int low=0, high=size-1 while (low<=higt int mid=(low+high)/2 f(a[mid<x low-mid+1 else if (x<a[mid]) high=mid-1 else return mid; return -111 int bsearch(int* a[],int size,int x) { int low=0, high=size-1; while (low<=higt) { int mid=(low+high)/2; if (a[mid]<x) low=mid+1; else if (x<a[mid]) high=mid-1; else return mid; } return -1 } Iterative binary search: