Register

Merge Sort - Miximum Input Size
closed

• closed by
636 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2015 Set 3 | Question: 27

Assume that a merge sort algorithm in worst case takes30s for an input of size 64. Which of the following closely approximate maximum input size of a problem that can be solved in 6min.

  1. 128
  2. 256
  3. 512
  4. 1024
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
sumit goyal 1 asked Aug 9, 2017
733 views
merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
User Avatar
0 votes
0 votes
3 answers
2
aditi19 asked Oct 6, 2018
1,153 views
Merge Sort Doubt
what is the recurrence relation for merge sort?
what is the recurrence relation for merge sort?
User Avatar
2 votes
2 votes
1 answer
3
Naveen Parihar asked Jun 26, 2018
2,054 views
Merge sort
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
User Avatar
1 votes
1 votes
1 answer
4
rahul sharma 5 asked Mar 9, 2018
1,323 views
Merge sort algorithm
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort? Is there any improvement over standard merge sort?
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort?...
User Avatar
Link Copied!