Top MCQs on MergeSort Algorithm with Answers (original) (raw)

Given a list of n string where each string is of length n. The list is sorted into lexicographic order using the Merge Sort algorithm. The worst case running time of this computation is

In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. Which of the following is the tightest upper bound on time complexity of this modified Merge Sort.

Which of the following sorting algorithms has the lowest worst-case complexity?

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

Which of the following is true about merge sort?

• Merge Sort works better than quick sort if data is accessed from slow sequential memory.
• Merge Sort is stable sort by nature
• Merge sort outperforms heap sort in most of the practical situations.

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

What is the best sorting algorithm to use for the elements in array are more than 1 million in general?

Which of the following is not a stable sorting algorithm in its typical implementation.

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after second pass of the algorithm is:

• 8, 9, 15, 20, 47, 4, 12, 17, 30, 40
• 8, 15, 20, 47, 4, 9, 30, 40, 12, 17
• 15, 20, 47, 4, 8, 9, 12, 30, 40, 17
• 4, 8, 9, 15, 20, 47, 12, 17, 30, 40

There are 13 questions to complete.

Take a part in the ongoing discussion