What is the time complexity of accessing an element by index in an array?

numbers = [10, 20, 30, 40] print(numbers[2])

Which searching algorithm requires the data to be sorted before searching?

Which is generally faster for large datasets?