Pergunta de entrevista da empresa Northrop Grumman
Give an example of recursion, and the time complexity of that algorithm.
Resposta da entrevista
Sigiloso
9 de mar. de 2022
Mergesort calls itself to break down lists and build them back up with a time complexity of O(n log n).