Pergunta de entrevista da empresa Qualcomm
Give an example of a divide and conquer algorithm.
Resposta da entrevista
Sigiloso
8 de nov. de 2011
Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)
Give an example of a divide and conquer algorithm.
Sigiloso
Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)