Microsoft interview question

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

Interview Answers

Anonymous

9 Oct 2012

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

1

Anonymous

17 Oct 2009

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

Anonymous

12 Nov 2009

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

1