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

Overall Stats

Attempted 230
Correct 102
Incorrect 19
Viewed 109

Answers

Guest
Guest
Lets Know
Lets Know - 4 years ago

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

Rohan Bhosale
Rohan Bhosale - 4 years ago

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

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying Divide and conquer is correct answer

Luiz Regalo Pural
Luiz Regalo Pural - 4 years ago

Luiz Regalo Pural from Philippines is saying Divide and conquer is correct answer

ismatmalik
ismatmalik - 4 years ago

ismatmalik from Pakistan is saying Divide and conquer is correct answer

Related Questions

Queue can be used to implement ?

  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort

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

Merge sort uses ?

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