Register

NPTEL MOOC

• edited by
1,616 views

1 Answer

1 1 vote
I think the answer has to be (B) or (D) because the statment "Quick sort always takes less than 1 sec " is false due to max time complexity of $n^{2}$.

Now, selection sort always runs in $n^{2}$ time. So, (D) is discarded, atleast partially.

So, I think answer is (B).

The other reason is for (A) to be wrong choice for this question is Merge sort is taking 0.2 sec while selection sort is taking 2.77 hrs.
Voting & Accepting an answer helps improve the community
← Previous · Binary Search TreeNext → · Parsing
← Previous in category · Binary Search TreeNext in category → · Hashing
Position:
Show:

Related questions

8 8 votes
6 6 answers
3.8k
3.8k views
Arjun asked Feb 27, 2025
3,797 views
GATE DA 2025 | Question: 19
Suppose that insertion sort is applied to the array $[1,3,5,7,9,11, x, 15,13]$ and it takes exactly two swaps to sort the array. Select all possible values of $x$.$10$$12...
3 3 votes
2 2 answers
140
140 views
GO Classes asked Aug 12
140 views
GO Classes DPP | GATE CS, DA | Algorithms | Selection Sort
What effect does the initial ordering of the records have on the number of comparisons performed by standard Selection Sort?No effect Only a constant-factor difference Th...
1 1 vote
2 2 answers
126
126 views
GO Classes asked Aug 11
126 views
GO Classes DPP | GATE CS, DA | Algorithms | Selection Sort
Suppose that a selectionsort of $100$ items has completed $42$ iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved...
1 1 vote
2 2 answers
121
121 views
GO Classes asked Aug 11
121 views
GO Classes DPP | GATE CS, DA | Algorithms | Selection Sort
In a selectionsort of n elements, how many times is the swap function called in the complete execution of the algorithm?$1$ $n-1$ $n\log n$ $n^2$