Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?

Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array? Correct Answer Merge sort

Insertion sort takes linear time to sort a partially sorted array. Though merge and quick sort takes O(n*logn) complexity to sort, merge sort is stable. Hence, Merge sort takes less time to sort partially sorted array.

Related Questions

A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?
S1: The mail is first collected from different letter boxes.
P: From there it is sent to the head post office.
Q: It is then sorted out at the sorting office.
R: The mail is again sorted out at the head office by the concerned beat postman.
S: The sorted mail is sent to the zonal post office.
S6: Finally it is delivered to us.

The Proper sequence should be:
A class III mathematics teacher gave the following questions to her students:  \(\begin{equation} \frac{ \begin{array}[b]{r} 256 \\ + 173 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 28 \\ + 32 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 129 \\ + 76 \end{array} }{ } \end{equation}\) Later she asks the students to solve a worksheet that has similar questions. Which of the following statements is appropriate for the given situation?
A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
In a public bathroom there are n taps 1,2,3...n. Tap1 and Tap2 take equal time to fill the tank while Tap3 takes half the time taken by Tap2 and Tap4 takes half the time taken by Tap3. Similarly each next number of tap takes half the time taken by previous number of Tap i.e, K-th Tap takes half the time taken by (K-1)th Tap.If the 10th tap takes 2 hours to fill the tank alone then what is the ratio of efficiency of 8th tap and 12th tap, respectively?
Introsort begins sorting the given array by using which of the following sorting algorithm?
Tim sort begins sorting the given array by using which of the following sorting algorithm?
Given delta is a global array and number of elements in the sorted array is 10, what are the values in the delta array?
An array that is first 7-sorted, then 5-sorted becomes _________