Related Articles

Related Articles

Algorithms | Divide and Conquer | Question 6
  • Difficulty Level : Basic
  • Last Updated : 02 Feb, 2013

Which of the following algorithms is NOT a divide & conquer algorithm by nature?
(A) Euclidean algorithm to compute the greatest common divisor
(B) Heap Sort
(C) Cooley-Tukey fast Fourier transform
(D) Quick Sort


Answer: (B)

Explanation: See Divide and Conquer

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :