Pergunta de entrevista da empresa Microsoft

Write a code for finding a certain element in an unsorted array assuming element definitely exists. How can we improve the efficiency?

Respostas da entrevista

Sigiloso

9 de out. de 2012

O(n) ia always smaller than O(nlogn)+O(logn). hence linear search will always be efficient

1

Sigiloso

17 de out. de 2009

i think the simplest way to solve is to scan it once, it will have O(n) complexity well any other answers?

Sigiloso

12 de nov. de 2009

it's O(n) to improve efficiency sort it first : O(nlgn) then every look-up becomes O(lgn)

1