Pergunta de entrevista da empresa Tripadvisor

What is the efficiency of finding an element in an unsorted array of strings

Respostas da entrevista

Sigiloso

2 de mai. de 2010

O(n)

3

Sigiloso

30 de out. de 2010

O(n/2), no?

Sigiloso

7 de jul. de 2014

Complexity is O(n) but running time can be faster if run parallel.

Sigiloso

28 de jan. de 2018

Yep the actual average time could be C * (N/2) but still the complexity in bigO format should be O(n).