假期作业day01（二分查找法）

算法题
1：二分查找法
package myBinaryFind;
`

/*
@author _86151
*/
_public class BinaryFindTest {

public static void main(String[] args) {<br />        int[] arr = {0,1,5,67,89,90,109,200};<br />        int target = 109;<br />        int binary = _binary_(arr, target);<br />        System._out_.println(binary);<br />    }
public static  int binary(int[] arr , int t){
    int l = 0 , r = arr.length-1,m ;<br />        while(l<=r){<br />            m = (l+r)/2;<br />            if(arr[m]==t){<br />                return m;<br />            }else if(arr[m]>t){<br />                r=m-1;<br />            }else {<br />                l=m+1;<br />            }<br />        }<br />        return -1;<br />    }

}

`