# 一个十分好的例子去写 Binary Search

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.

Suppose you have n versions [1, 2, …, n] and you want to find out the first bad one, which causes all the following ones to be bad.

You are given an API bool isBadVersion(version) which will return whether the version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

Example:

```
Given n = 5, and version = 4 is the first bad version.

Then 4 is the first bad version.

```

Solution by Colin:

```
/**
*
* @param {integer} version number
* @return {boolean} whether the version is bad
*     ...
* };
*/

/**
* @return {function}
*/
/**
* @param {integer} n Total versions
* @return {integer} The first bad version
*/
return function(n) {

var L = 1, R = n;

while(L < R-1){

var M = parseInt((L+R)/2);

if(!curVer){
L = M;
}
else{
if(M === 1) return 1;
R = M;
}

}

//For edge case such as [1], [1,2]
for(var i = L; i <= R; i++){