5 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 482
Correct 164
Incorrect 78
Viewed 240

Answers

Guest
Guest
Serkie Mekonnen
Serkie Mekonnen - 1 week ago

Serkie Mekonnen from Dessie, Ethiopia is saying Divide and conquer is correct answer

Narender Kumar
Narender Kumar - 3 weeks ago

Narender Kumar is saying Divide and conquer is correct answer

Marem Husen
Marem Husen - 1 month ago

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

deepak kumar
deepak kumar - 1 month ago

deepak kumar is saying Divide and conquer is correct answer

Uga Balu
Uga Balu - 1 month ago

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

Related Questions

What is data structure?


View Answer

Which of the following is useful in implementing quick sort?

  • [A] Stack
  • [B] Set
  • [C] List
  • [D] Queue

View Answer

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

View Answer

The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out values are ?

  • [A] 2,2,1,1,2
  • [B] 2,2,1,2,2
  • [C] 2,1,2,2,1
  • [D] 2,1,2,2,2

View Answer

Queue can be used to implement ?

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

View Answer