What's the time complexity of indexing a numpy array directly

Question

I assume when having a numpy array, let\'s say

>>>>nArray
array([[  23425.     ,  521331.40625],
       [  23465.     ,  521246.03125],
       [         


        

Answer 1

There is no hash table involved. Numpy arrays are arrays, just like the name implies, and the address is computed like this:

address of nArray[x, y] = base address + A * x + B * y