I’ve heard a lot of arguments in favour of starting at 1 and as a “start at 0” person, I’m starting to question my beliefs and am as confused as I was at 3 am when I saw my cat piss from inside her litter box onto the parquet flooring and then slip on it.
Indexing by zero has a huge positive impact on the correctness of complex operations like joining intervals, that nobody trusts themselves to write anyway and always pack behind a well-verified library.
But I think the reason we have it is because C maps it almost immediately into memory offsets.
Find yourself a language that allows negative indices to count back from the end of an array.
In those languages, index 0 is usually the first element, but if you’re particularly perverse and negate your indexing, you can start at 1, or rather -1, at the other end and work backwards.
0-indexing originally comes from needing to add to the array’s base memory address to locate elements. If you have an array at memory address 1234, you might expect to find the first element at that address, which would be 1234+0, and the next at 1234+1, etc.
1-indexing started as either a deliberate abstraction from that idea, and/or else there’s something else stored at 1234 that the array data type needs and the real elements start at 1234+1.
All that said, there’s at least one language that insists the indices of an array be of a subtype of some Integer type that must have a limited range. Then you can start and end wherever you like, and the whole 1 vs 0 business is meaningless (except to whoever writes the compilers for that language anyway).
I’ve heard a lot of arguments in favour of starting at 1 and as a “start at 0” person, I’m starting to question my beliefs and am as confused as I was at 3 am when I saw my cat piss from inside her litter box onto the parquet flooring and then slip on it.
Not indexing at zero seems like a waste of a perfectly good integer.
Yea ther is a big difference between indexing and counting
Element 0 is the first element of the list
Unless you are saving it for something else, like the header of a table:-).
True programming chads don’t index at all, they just bind functions to the list monad.
Indexing by zero has a huge positive impact on the correctness of complex operations like joining intervals, that nobody trusts themselves to write anyway and always pack behind a well-verified library.
But I think the reason we have it is because C maps it almost immediately into memory offsets.
Like any other convention, it’s not really a big deal either way. Fortran gets along just fine with 1-indexing.
Find yourself a language that allows negative indices to count back from the end of an array.
In those languages, index 0 is usually the first element, but if you’re particularly perverse and negate your indexing, you can start at 1, or rather -1, at the other end and work backwards.
0-indexing originally comes from needing to add to the array’s base memory address to locate elements. If you have an array at memory address 1234, you might expect to find the first element at that address, which would be 1234+0, and the next at 1234+1, etc.
1-indexing started as either a deliberate abstraction from that idea, and/or else there’s something else stored at 1234 that the array data type needs and the real elements start at 1234+1.
All that said, there’s at least one language that insists the indices of an array be of a subtype of some Integer type that must have a limited range. Then you can start and end wherever you like, and the whole 1 vs 0 business is meaningless (except to whoever writes the compilers for that language anyway).