4 ms·

Because modulo arithmetic needs to include 0, so if you do modulo arithmetic on indices 0 based indexing is better.

• romwell 5y ago
  One solution to that is have inherently modular array indexing, so that any index is valid. If A[1] is the first element, then A[0] would be the last; etc
  • 0-_-0 5y ago
    That's a good idea!
  • mst 5y ago
    I do appreciate languages that allow -1 for the last index.
    • layer8 5y ago
      That makes it difficult to calculate the distance (length of the slice) between two arbitrary indices though.
      • romwell 5y ago
        Well, that's when you can use the mod operator instead of having to do it when indexing into an array (a much more common operation).