Qualcomm interview question
Give an example of a divide and conquer algorithm.
Interview Answer
Anonymous
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.
Anonymous
Merge sort. you divide the set into more manageable subsets then recombine later. O(nlogn)
Check out your Company Bowl for anonymous work chats.