What is the algorithmic complexity of searching for an element by index?

O(1).

When searching for an element by index in most data structures (for example, in arrays or ArrayList in Java), the memory address of the cell corresponding to the index can be calculated directly. This requires constant time, regardless of the size of the data structure.