kotlin 二分查找算法

/**
 * 二分查找
 * 条件：必须采用顺序结构存储
 * 2，必须关键字大小排列有序
 */

private fun binarySearch(intArray: IntArray, target: Int): Int {
    var start = 0
    var end = intArray.size - 1
    while (start <= end) {
        val middle = start + end ushr 1
        when {
            target == intArray[middle] -> {
                return middle
            }
            target < intArray[middle] -> {
                end = middle - 1
            }
            target > intArray[middle] -> {
                start = middle + 1
            }
        }
    }
    return -1
}