Qualcomm Interview Question

Give an example of a divide and conquer algorithm.

Interview Answer

Anonymous

Nov 8, 2011

Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)