Question d’entretien chez Qualcomm
Give an example of a divide and conquer algorithm.
Réponse à la question d'entretien
Utilisateur anonyme
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.
Utilisateur anonyme
Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)