Davinder Singh
Davinder Singh - 4 years ago in Data Structure

Merge sort uses ?

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

Overall Stats

Attempted 419
Correct 142
Incorrect 48
Viewed 229

Answers

Guest
Guest
Mital Patel
Mital Patel - 1 month ago

Mital Patel from Ahmedabad, India is saying Backtracking approach is correct answer

Sohail Javed
Sohail Javed - 7 months ago

Sohail Javed from Rawalpindi, Pakistan is saying Divide and conquer strategy is correct answer

Jawad Awan
Jawad Awan - 7 months ago

Jawad Awan from Jamshoro, Pakistan is saying Divide and conquer strategy is correct answer

Mayank Pathak
Mayank Pathak - 8 months ago

Mayank Pathak from Muzaffarpur, India is saying Divide and conquer strategy is correct answer

akanksha singh
akanksha singh - 8 months ago

akanksha singh from Vadodara, India is saying Backtracking approach is correct answer

Related Questions

Davinder Singh
Davinder Singh - 4 years ago in Data Structure
A vertex of degree one is called
  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex
Davinder Singh
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 *
  • Muhammad Aown
  • Zuhaib Dar
Davinder Singh
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