Question

Explain Quick Sort with example.

Answer 1

Explanation:

quick sort is a divide and conquer algorithm

it creates two empty arrays to hold element less than the pivot value and elements greater than the pivot value, and then recursively sort the sub arrays. there are two basic operations in the algorithm, swapping items in place and partitioning a section of the array.