Back to the 2022 paper
Similar questions
Design and Analysis of Algorithms Differentiate between divide & conquer, greedy method and dynamic programming with suitable examples.20227mDesign & Analysis of AlgorithmsCompare the various programming paradigms such as divide-and-conquer, dynamic programming and greedy approach.20197mDesign and Analysis of Algorithms Write a short note on: Dynamic Programming20257mDesign & Analysis of AlgorithmsWrite short notes on: Divide-and-Conquer vs Dynamic programming20237m
PreviousGiven an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity? - (i) Insertion sort with time complexity O(kn) - (ii) Heap sort with time complexity O(n \log k) - (iii) Quick sort with time complexity O(k \log k) - (iv) Merge sort with time complexity O(k \log k)NextIn the divide and conquer process, breaking the problem into smaller sub-problems is the responsibility of: - (i) divide/break - (ii) sorting/divide - (iii) conquer/solve - (iv) merge/combine