Pergunta de entrevista da empresa Maven Systems
Few questions on time complexity?
Resposta da entrevista
Sigiloso
17 de nov. de 2016
For brute force it is o(n) and for recursion algorithm it would o(nlogn)
Few questions on time complexity?
Sigiloso
For brute force it is o(n) and for recursion algorithm it would o(nlogn)