6 years ago in Data Structure

Merge sort uses ?

[A] Divide and conquer strategy
[B] Backtracking approach
[C] Heuristic search
[D] Greedy approach
Loading...
Next Question

Overall Stats

Attempted 463
Correct 167
Incorrect 59
Viewed 237

Answers

Guest
Guest
Miethali Kulkarni
Miethali Kulkarni - 2 months ago

Miethali Kulkarni is saying Backtracking approach is correct answer

Sanju Rebel
Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying Divide and conquer strategy is correct answer

Serkie Mekonnen
Serkie Mekonnen - 8 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying Greedy approach is correct answer

Marem Husen
Marem Husen - 9 months ago

Marem Husen from Al Musayyib, Iraq is saying Backtracking approach is correct answer

Uga Balu
Uga Balu - 9 months ago

Uga Balu from Chennai, India is saying Divide and conquer strategy is correct answer

Related Questions

Linked list are not suitable data structure of which one of the following problems ?

  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation

Sparse matrices have ?

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