Pregunta de entrevista de Northrop Grumman
Give an example of recursion, and the time complexity of that algorithm.
Respuesta de la entrevista
Anónimo
9 mar 2022
Mergesort calls itself to break down lists and build them back up with a time complexity of O(n log n).