Please don't give incorrect answers. Only divide and conquer paradigm is needed.

Given an array A of n integers stored in locations 0 to n 1 and a positive integer k less than n. Design an efficient algorithm using divide and conquer technique to compute the k largest integers from the array. Note: Observe that you can sort the array and output the top k elements. That will require O(n log n) time. So try to devise an algorithm which has better time complexity than O(n log n).