Register

GATE Suitability Test | Test 1 | Question: 1

285 views
1 votes
1 votes

Given a sequence of numbers where numbers at odd positions as well as even positions are  sorted in increasing order. For example

1 42 3 44 6 45 9

Which of the following sorting algorithm performs the best here with respect to the number of comparisons performed?
 

  1. Insertion sort
  2. Bubble sort
  3. Selection sort
  4. Asymptotically all the above three have the same worst case performance
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
2
Arjun asked Jun 10, 2018
153 views
GATE Suitability Test | Test 1 | Question: 11
Consider the following C program? void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; } The number of ‘0’s printed by above program is ?
Consider the following C program?void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; }The num...
User Avatar
1 votes
1 votes
1 answer
3
Arjun asked Jun 10, 2018
314 views
GATE Suitability Test | Test 1 | Question: 2
The set of values printed (in any order) by the following code will be #include<stdio.h> #include<unistd.h> int main() { static int count; if(fork()) { count++; } if(fork() && !count++) count++; printf(“%d \t”, count); } 0 1 1 2 0 0 1 2 0 1 2 2 2 2 2 2
The set of values printed (in any order) by the following code will be#include<stdio.h #include<unistd.h int main() { static int count; if(fork()) { count++; } if(fork() ...
User Avatar
1 votes
1 votes
1 answer
4
Arjun asked Jun 10, 2018
324 views
GATE Suitability Test | Test 1 | Question: 3
A coin is such that after every toss the probability of same side coming again increases by $50\%$ from the initial value. If initially the probability of head and tail are the same, what is the expected number of tosses until we get a head?
A coin is such that after every toss the probability of same side coming again increases by $50\%$ from the initial value. If initially the probability of head and tail a...
User Avatar
Link Copied!