What algorithm is used when searching for an element by its position in an array, and what is its time complexity?

When searching for an element by its position (index) in an array, direct access by index is used — this algorithm is called indexed access.

Arrays in Java are implemented as a contiguous block of memory, so access to an element by index occurs in constant time O(1). This means that regardless of the size of the array, the time to access an element by position does not change.

Example:

int[] arr = {10, 20, 30, 40};
int element = arr[2]; // Gets the 3rd element (index 2), which is quick and efficient

Thus, the algorithm is direct indexed access, with a time complexity of O(1).