Register

ISRO2018-35

• edited by
2,445 views
1 votes
1 votes

Given two sorted list of size $m$ and $n$ respectively. The number of comparisons needed the worst case by the merge sort algorithm will be:

  1. $m \times n$
  2. maximum of $m$ and $n$
  3. minimum of $m$ and $n$
  4. $m+n-1$
• edited by
User Avatar

1 Answer

Best answer
3 votes
3 votes

option d

worst case comparisons in merge sort is o(m+n-1)

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Arjun asked Apr 22, 2018
4,161 views
ISRO2018-7
Assume $A$ and $B$ are non-zero positive integers. The following code segment: while(A!=B){ if*(A> B) A -= B; else B -= A; } cout<<A; // printing the value of A Computes the $LCM$ of two numbers Divides the larger number by the smaller number Computes the $GCD$ of two numbers Finds the smaller of two numbers
Assume $A$ and $B$ are non-zero positive integers. The following code segment:while(A!=B){ if*(A B) A -= B; else B -= A; } cout<<A; // printing the value of AComputes the...
User Avatar
1 votes
1 votes
1 answer
2
Arjun asked Apr 22, 2018
5,181 views
ISRO2018-12
An array $A$ consists of $n$ integers in locations $A[0], A[1], \ldots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $k$ places, where $1<=k<=(n-1)$. An incomplete algorithm for doing this in linear time, without using another array is given ...
An array $A$ consists of $n$ integers in locations $A[0], A , \ldots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $k$ places, wher...
User Avatar
3 votes
3 votes
1 answer
3
Arjun asked Apr 22, 2018
5,081 views
ISRO2018-16
The following paradigm can be used to find the solution of the problem in minimum time: Given a set of non-negative integer and a value $K$, determine if there is a subset of the given set with sum equal to $K$: Divide and Conquer Dynamic Programming Greedy Algorithm Branch and Bound
The following paradigm can be used to find the solution of the problem in minimum time:Given a set of non-negative integer and a value $K$, determine if there is a subset...
User Avatar
4 votes
4 votes
2 answers
4
Arjun asked Apr 22, 2018
3,900 views
ISRO2018-33
Which of the following is application of Breath First Search on the graph? Finding diameter of the graph Finding bipartite graph Both (a) and (b) None of the above
Which of the following is application of Breath First Search on the graph?Finding diameter of the graphFinding bipartite graphBoth (a) and (b)None of the above
User Avatar
Link Copied!