What is the asymptotic complexity of "arbitrary index access in a doubly linked list"?

Question

Algorithms

Good afternoon!
Tell me what is the asymptotic complexity of the operation "access by an arbitrary index in a doubly linked list" using O-notation.
Thank you!

Answer 1

O(n/2) - you have to go from element to element anyway, but if the index is more than half the length - you can start from the end, and thus go through a maximum of half of the list.