In a linear search over n elements, what is the best-case time complexity?