>Has been there at least since C - which must be the seventies
>
>Think of zero based as an offset
>
>It does have its advantages. If you start counting from zero, the address where element n starts is the startAddress + n * widthOfElement
>
>For one based it would be startAddress + ( n-1) * widthOfElement
>
>Zero based : for 0 to count-1
>One based : for 1 to count

I still think a universal one based approach would have been enough.

lol