冒泡排序+二分查找

let bsArray = [2, 1, 4, 7, 5, 10, 3, 6, 9, 8]
const bubbleSorting = (res) => {
    for (let i = 0; i < res.length - 1; i++) {
        for (let j = 0; j < res.length - 1 - i; j++) {
            if (res[j] > res[j + 1]) {
                let t = res[j + 1]
                res[j + 1] = res[j]
                res[j] = t
            }
        }
    }
    return res
}
console.log('bsArraySort:', bubbleSorting(bsArray))

let binArray = [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 10]
const binarysearch = (res, value) => {
    let indexStart = 0
    let indexEnd = res.length - 1

    while (indexStart <= indexEnd) {
        let indexMid = Math.floor((indexStart + indexEnd) / 2)
        if (res[indexMid] > value) {
            indexEnd = indexMid + 1
        }
        else if (res[indexMid] < value) {
            indexStart = indexMid - 1
        }
        else {
            if (indexMid == 0 || res[indexMid - 1] < value) {
                return indexMid
            }
            indexEnd = indexMid + 1
        }
    }
    return -1
}

console.log('binArray:', binarysearch(binArray, 3))