Question

The algorithm design technique used in the quicksort algorithm is

Answer 1

Hey There!

Quick Sort is a Divide-and-Conquer Algorithm.



A Divide and Conquer Algorithm breaks up a problem into many parts ("Divide") and then solves each part individually ("Conquer") 


Quick Sort is a sorting Algorithm.


In Quick Sort, to sort an array: 

-> We first chose a "pivot" element of the array. This divides the array in two parts: One part of elements before the pivot, and one part is after that.

-> Now, we reorder the array so that all elements smaller than the pivot come before the pivot, and all elements larger than the pivot come after the pivot.

-> The above steps are recursively applied to sub-arrays, one containing smaller values, and one containing larger values


Essentially, Quick Sort divides an Array into Sub Arrays, and works on each part individually.

So, Quick Sort is a Divide and Conquer Algorithm.

Hope it helps
Purva
Brainly Community

Answer 2

Answer:

hope it's helpful for you please follow me and mark my answer as brilliant