Questions d'entretien

Entretien pour Machine Learning Engineer



how to sort in O(Logn) time


Réponses aux questions d'entretien

3 réponse(s)


I don't think you can sort in O(logn) because you will need to go through the whole data at least once, making it O(n). Indeed, you can do it in O(logn) if the data is guarantee with some specific constrain or relationship. I think the best you can sort a completely random data is O(nlogn).

Utilisateur anonyme le


I didn't come up with the answer. it is not difficult, just not prepared

Utilisateur anonyme le


what is the question

Utilisateur anonyme le

Ajouter des réponses ou des commentaires

Pour commenter ceci, connectez-vous ou inscrivez-vous.