【算法】js递归遍历数组

let arr = [1, 2, 3];
function recursion(arr, i) {
    if(arr == null || arr.length <= i) return;
    console.log(arr[i])
    recursion(arr, i + 1)
}
recursion(arr, 0)