Empleador activo
Write a code for finding a certain element in an unsorted array assuming element definitely exists. How can we improve the efficiency?
Anónimo
O(n) ia always smaller than O(nlogn)+O(logn). hence linear search will always be efficient
i think the simplest way to solve is to scan it once, it will have O(n) complexity well any other answers?
it's O(n) to improve efficiency sort it first : O(nlgn) then every look-up becomes O(lgn)
Sigue a tus empresas favoritas para estar al tanto de las últimas oportunidades y disponer de información desde adentro.
Recibe recomendaciones y actualizaciones personalizadas al iniciar tu búsqueda.