Register

ISRO2017-15

4,914 views
10 votes
10 votes

Which one of the following in-place sorting algorithms needs the minimum number of swaps?

  1. Insertion Sort
  2. Quick Sort
  3. Heap Sort
  4. Selection Sort
User Avatar

5 Answers

0 votes
0 votes
Quick sort....as it is having pivot point...then compared
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

9 votes
9 votes
5 answers
1
sh!va asked May 7, 2017
8,001 views
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
User Avatar
14 votes
14 votes
3 answers
2
sh!va asked May 7, 2017
4,255 views
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
User Avatar
5 votes
5 votes
3 answers
3
sh!va asked May 7, 2017
4,433 views
ISRO2017-76
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
Which of the following algorithms solves the all pair shortest path problem?Prim's algorithmDijkstra's algorithmBellman ford algorithmFloyd warshalls algorithm
User Avatar
29 votes
29 votes
7 answers
4
Kathleen asked Oct 4, 2014
18,083 views
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The recurrence relation that arises in relation with the complexity of binary search is:$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$T(n) = T\left(\fra...
User Avatar
Link Copied!