Domande di colloquio di Microsoft: Write a code for finding a certain element in an unsorted array assuming element definitely exists. How can we improve the efficiency? | Glassdoor

Passa al contenuto Passa al piè di pagina

employer cover photo

Microsoft

Colloquio per Software Engineer presso Microsoft

Domanda di colloquio di Microsoft

Colloquio per Software Engineer

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

Risposte di colloquio

Anonimo

9 ott 2012

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

1

Anonimo

17 ott 2009

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

Anonimo

12 nov 2009

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

1

Ricerche correlate: Recensioni su Microsoft | Offerte di lavoro di Microsoft | Stipendi di Microsoft | Benefit di Microsoft

Colloqui di Microsoft