/** * ibs.c * A stub for a simple binary search. */ #include #include "ibs.h" // +------------------+----------------------------------------------- // | Student Examples | // +------------------+ int version1 (int A[], int len, int v) { int lb = 0; int ub = len-1; int mid = (lb + ub)/2; while (lb <= ub) { if (A[mid] < v) lb = mid; else if (A[mid] == v) return mid; else ub = mid; mid = (lb + ub)/2; } // while return -1; } // v1 // +--------------------+--------------------------------------------- // | Exported Functions | // +--------------------+ int ibs (int A[], int len, int v) { return version1(A, len, v); } // ibs