Question d’entretien chez Maven Systems
Few questions on time complexity?
Réponse à la question d'entretien
Utilisateur anonyme
17 nov. 2016
For brute force it is o(n) and for recursion algorithm it would o(nlogn)
Few questions on time complexity?
Utilisateur anonyme
For brute force it is o(n) and for recursion algorithm it would o(nlogn)