Register

Divide and Conquer

• retagged by
383 views
0 votes
0 votes

Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?

• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Emankashyap asked 2 days ago
27 views
Divide and conquer
In quick sort, n numbers the (n/10)th element is selected as pivot using n^2 sortimng time complexity what will be the time complexity of quick sort is..... a)O(nlogn) b)O(n^2) c)O(n^3) d)O(n)
In quick sort, n numbers the (n/10)th element is selected as pivot using n^2 sortimng time complexity what will be the time complexity of quick sort is.....a)O(nlogn)b)O(...
User Avatar
1 votes
1 votes
1 answer
2
meethunjadhav asked Jul 30, 2018
448 views
Ace volume-2 divide and conquer method
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys? here, ans is 24 sec how it is plz explain me.
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
User Avatar
0 votes
0 votes
1 answer
4
ajit asked Sep 7, 2015
671 views
if this problem is solved using divide and conquer method ,then the algorithm run in
given a sorted array of distinct integers A[1........n], you want to find out whether there is an index i for which A[i]=i.if this problem is solved using divide and conquer method ,then the algorithm run in a) O(n) a) O(nlogn) a) O(logn) a) O(n2)
given a sorted array of distinct integers A[1........n], you want to find out whether there is an index i for which A[i]=i.if this problem is solved using divide and conq...
User Avatar
Link Copied!