Code Pages

An open and high-quality programming technology exchange space

JavaScript 相关

function recursiveSum(arr) {
    if (arr.length === 0) return 0;
    return arr[0] + recursiveSum(arr.slice(1));
}

// use recursiveSum
console.log(recursiveSum([1, 2, 3, 4]));

算法相关

function binarySort(arr) {
    for (let i = 1; i < arr.length; i++) {
        let current = arr[i];
        let left = 0;
        let right = i - 1;
        
        while (left <= right) {
            let mid = Math.floor((left + right) / 2);
            if (arr[mid] < current) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        for (let j = i - 1; j >= left; j--) {
            arr[j + 1] = arr[j];
        }
        arr[left] = current;
    }
    return arr;
}

CSS Example