GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

asked in Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer by gate

1 Answer

0 votes
B

Heap Sort
answered by gate

Related questions

The best answer to any question