21 votes 21 votes Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method Algorithms gate1994 algorithms algorithm-design-technique quick-sort easy isro2016 + – Kathleen asked Oct 4, 2014 • retagged Dec 4, 2022 by Lakshman Bhaiya Kathleen 18.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 28 votes 28 votes Answer: Option C. It is one of the efficient algorithms in Divide and Conquer strategy. Gate Keeda answered Oct 7, 2014 • edited Jun 25, 2018 by Pooja Khatri Gate Keeda comment Share Follow See 1 comment See all 1 1 comment reply i_ronak commented Dec 19, 2022 reply Follow Share @Deepak Poonia sir, but there is only divide step in quicksort and no conquer step….so shouldn't it be comparison based algorithm….because this works by comparing and swapping elements using top down approach 0 votes 0 votes Please log in or register to add a comment.
8 votes 8 votes Quick sort uses Divide and Conquer. asu answered Jul 4, 2016 • edited Jun 13, 2018 by Milicevic3306 asu comment Share Follow See all 0 reply Please log in or register to add a comment.
7 votes 7 votes Algorithm design technique used in quicksort algorithm is C. Divide and conquer Raushank2 answered May 3, 2017 Raushank2 comment Share Follow See all 0 reply Please log in or register to add a comment.
6 votes 6 votes Algorithm design technique used in quicksort algorithm is Divide And Conquer. hence ans is (C) Divide and conquer Warrior answered May 3, 2017 Warrior comment Share Follow See all 0 reply Please log in or register to add a comment.