O(n2)

O(n log n)

Write Answer O(n)

Explanation

Linear search has a time complexity of O(n) since it checks each element one by one.