7 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 311
Correct 107
Incorrect 33
Viewed 171

Answers

Guest
Guest
Govind nama
Govind nama - 6 months ago

Govind nama is saying Greedy approach is correct answer

Shourya Singh Rawat
Shourya Singh Rawat - 4 years ago

Shourya Singh Rawat from India is saying Divide and conquer strategy is correct answer

Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying Divide and conquer strategy is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying Divide and conquer strategy is correct answer

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying Backtracking approach is correct answer

Related Questions

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

Sparse matrices have ?

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