Which of the following is NOT a divide and conquer method?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. Heap Sort
Explanation
Binary search, merge sort and quick sort split the problem into sub-problems. Heap sort repeatedly extracts the maximum from a heap and is not divide and conquer.More Data Structures and Algorithms questions
- Arrange the following steps of the inorder traversal of a binary tree in the correct order. A. Visit the left subtree B. Visit the root nod…
- Which of the following algorithms are based on Breadth First Search (BFS)? A. Prim's algorithm B. Kruskal's algorithm C. Dijkstra's algorit…
- Which of the following is the solution of the recurrence relation T(n) = T(2n/3) + 1?
- Which of the following description(s) is/are true? A. Red-Black Tree – guarantees worst case O(log n) time for search, insert & delete. B.…
- Match List I with List IIList I List II A. Insertion Sort I. O(log n) B. Binary Search II. O(n²) C. Quick Sort III. O(n) D. Selection Sort…
- Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T…