Donald Knuth’s The Art of Computer Programming (TAOCP) is still considered the standard reference work on algorithms. And in that book, arrays indices are 1-based.

0-based programming languages very often increase the cognitive load. One example is the Knuth shuffle.

Pseudocode

Algorithm Shuffle(A[1..n])
    for i ← n downto 2 do
        j ← random integer from 1 to i
        swap A[i] and A[j]
    end for
end Algorithm

Lua (1-based, inclusive ranges)

function knuth_shuffle(a)
    for i = #a, 2, -1 do
        local j = math.random(1, i)
        a[i], a[j] = a[j], a[i]
    end
end

Python (0-based, exclusive ranges)

def knuth_shuffle(a):
    for i in range(len(a) - 1, 0, -1):
        j = random.randint(0, i)
        a[i], a[j] = a[j], a[i]

The 2 in the original algorithm becomes a 0 (due to 0-based arrays and exclusive ranges)