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

Overall Stats

Attempted 432
Correct 137
Incorrect 70
Viewed 225

Answers

Guest
Guest
Mital Patel
Mital Patel - 1 month ago

Mital Patel from Ahmedabad, India is saying Dynamic programming is correct answer

Haranadh Banda
Haranadh Banda - 7 months ago

Haranadh Banda from Vijayawada, India is saying Greedy method is correct answer

Sohail Javed
Sohail Javed - 7 months ago

Sohail Javed from Rawalpindi, Pakistan is saying Backtracking is correct answer

Jawad Awan
Jawad Awan - 7 months ago

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

Gaurav Jain
Gaurav Jain - 8 months ago

Gaurav Jain from Delhi, India is saying Divide and conquer is correct answer

Related Questions

Davinder Singh
Davinder Singh - 4 years ago in Data Structure
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
  • [A] 2 deletions and 3 additions
  • [B] 3 additions and 2 deletions
  • [C] 3 deletions and 3 additions
  • [D] 3 deletions and 4 additions
  • Deepali Nimje
Davinder Singh
Davinder Singh - 4 years ago in Data Structure
Which of the following statement is true ?
  • [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
  • [B] Breath first search cannot be used to find converted components of a graph.
  • [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
  • [D] Depth first search can be used to find connected components of a graph.
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