Davinder Singh - 4 years ago in Data Structure

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

[A] mn
[B] max(m,n)
[C] min(m,n)
[D] m+n-1
Loading...

Answers

Guest

Related Questions

Davinder Singh - 4 years ago in Data Structure
The postfix expression for * + a b - c d is?
  • [A] ab + cd - *
  • [B] ab cd + - *
  • [C] ab + cd * -
  • [D] ab + - cd *
Davinder Singh - 4 years ago in Data Structure
Which of the following algorithm design technique is used in the quick sort algorithm?
  • [A] Dynamic programming
  • [B] Backtracking
  • [C] Divide and conquer
  • [D] Greedy method