6 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...
Next Question

Overall Stats

Attempted 418
Correct 60
Incorrect 123
Viewed 235

Answers

Guest
Guest
Bert Chen
Bert Chen - 2 months ago

Bert Chen is saying m+n-1 is correct answer

Sanju Rebel
Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying m+n-1 is correct answer

Serkie Mekonnen
Serkie Mekonnen - 8 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying mn is correct answer

Narender Kumar
Narender Kumar - 8 months ago

Narender Kumar is saying mn is correct answer

Marem Husen
Marem Husen - 9 months ago

Marem Husen from Al Musayyib, Iraq is saying m+n-1 is correct answer

Related Questions

Sparse matrices have ?

  • [A] no zero
  • [B] many zero
  • [C] higher dimenstion
  • [D] none

Merge sort uses ?

  • [A] Divide and conquer strategy
  • [B] Backtracking approach
  • [C] Heuristic search
  • [D] Greedy approach

An IP address is a numeric quantity that identifies -

  • [A] a network adapter to other devices on the network
  • [B] the manufacturer of a computer
  • [C] the physical location of a computer
  • [D] none of the above