Domanda di colloquio di Qualcomm
Give an example of a divide and conquer algorithm.
Risposta di colloquio
Anonimo
8 nov 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.
Anonimo
Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)