What is the best case and worst case complexity of ordered linear search?

I'm sorry, but you didn't provide a text to respond in the same language. Could you please provide the text?

The best case complexity of an ordered linear search is O(1). This occurs when the target element is the first element of the list.

The worst case complexity of an ordered linear search is O(n). This happens when the target element is the last element of the list or not in the list at all. In this case, the algorithm has to traverse through all the elements in the list.

Here, 'n' represents the number of elements in the list.