0 votes 0 votes Which of the following algorithm design approach is used in Quick sort algorithm? Dynamic programming Back Tracking Divide and conquer Greedy approach Others ugcnetcse-oct2022-paper1 algorithm-design quick-sort + – admin asked Oct 23, 2022 • edited Dec 21, 2023 by makhdoom ghaya admin 342 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes The quick sort algorithm is based on divide and conquer approach. (GATE 1994) Option (C) is correct. Hira Thakur answered Nov 22, 2022 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Divide and Conquer approach shriram answered Nov 21, 2022 • edited Nov 24, 2022 by shriram shriram comment Share Follow See all 2 Comments See all 2 2 Comments reply Hira Thakur commented Nov 22, 2022 reply Follow Share shriram, The quick sort algorithm is based on the divide and conquer approach. 1 votes 1 votes shriram commented Nov 22, 2022 reply Follow Share Thank you! Changed the answer! 0 votes 0 votes Please log in or register to add a comment.