Question d’entretien chez Visier
Implement some algorithm with no greater than O(n log n) complexity
Réponse à la question d'entretien
Utilisateur anonyme
5 mars 2015
Wrote some code in C but I could only do as well as O(n^2), but that's because I was concerned about linear cache misses and pushing more registers onto the stack with function calls.