5 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 460
Correct 166
Incorrect 58
Viewed 236

Answers

Guest
Guest
Serkie Mekonnen
Serkie Mekonnen - 1 week ago

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

Marem Husen
Marem Husen - 1 month ago

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

Uga Balu
Uga Balu - 1 month ago

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

uma
uma - 2 months ago

uma from Hindupur, India is saying Divide and conquer strategy is correct answer

Priya
Priya - 2 months ago

Priya from Hyderabad, India is saying Greedy 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

A vertex of degree one is called

  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex

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