Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Algorithms | Divide and Conquer | Question 6

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

Article Tags :
DSA Quiz
Recommended Articles
1. Algorithms | Divide and Conquer | Question 2
2. Algorithms | Divide and Conquer | Question 3
3. Algorithms | Divide and Conquer | Question 4
4. Algorithms | Divide and Conquer | Question 5
5. Advantages and Disadvantages of Divide and Conquer Algorithms
6. Algorithms | Analysis of Algorithms (Recurrences) | Question 1
7. Algorithms | Analysis of Algorithms (Recurrences) | Question 2
8. Algorithms | Analysis of Algorithms | Question 2
9. Algorithms | Analysis of Algorithms | Question 3
10. Algorithms | Analysis of Algorithms | Question 4
11. Algorithms | Analysis of Algorithms | Question 5
12. Algorithms | Analysis of Algorithms | Question 19
13. Algorithms | Analysis of Algorithms (Recurrences) | Question 4
14. Algorithms | Analysis of Algorithms | Question 8
15. Algorithms | Analysis of Algorithms | Question 9
16. Algorithms | Analysis of Algorithms | Question 10
17. Algorithms | Analysis of Algorithms | Question 11
18. Algorithms | Analysis of Algorithms | Question 12
19. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
20. Algorithms | Analysis of Algorithms (Recurrences) | Question 6
21. Algorithms | Analysis of Algorithms | Question 13
22. Algorithms | Analysis of Algorithms (Recurrences) | Question 7
23. Algorithms | Analysis of Algorithms (Recurrences) | Question 8
24. Algorithms | Analysis of Algorithms | Question 15
25. Algorithms | Analysis of Algorithms (Recurrences) | Question 9