Register

Test MadeEasy

• retagged by
1,218 views
0 0 votes

What will be the answer of this question?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · IITH Winter Mtech RA...Next → · Doubt - Source : Sta...
← Previous in category · made easyNext in category → · Doubt - Source : Sta...
Position:
Show:

Related questions

10 10 votes
6 6 answers
4.0k
4.0k views
Arjun asked Feb 27, 2025
3,997 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...
0 0 votes
2 2 answers
1.6k
1.6k views
rahul sharma 5 asked Dec 8, 2017
1,618 views
MadeEasy Test Series: Algorithms - Sorting
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sortB Selection sortC Merge s...
1 1 vote
1 1 answer
149
149 views
GO Classes asked Aug 25
149 views
GO Classes DPP | GATE CS, DA | Algorithms | Sorting Complexity
Let $P$ be the problem of sorting $n\geq1$ elements using only comparisons.Consider the class of all comparison-based algorithms that correctly solve $P$.What is the asym...
2 2 votes
2 2 answers
193
193 views
Shubham Sharma 2 asked Apr 19
193 views
UGC NET CSE | December 2025 | Part 2 | Question: 41
Which of the following is correct order of increasing time complexity of algorithmsTower of Hanoi with $n$ disk.Binary search given $n$ sorted numbers.Heap sort given $n$...