Quick Sort | Easy Explanation | Using Python

Quicksort is a sorting algorithm based on the divide and conquer approach where

An array is divided into subarrays by selecting a pivot element (element selected from the array).

Time Complexity
--------------------------------
Best O(n*log n)
Worst O(n2)
Average O(n*log n)

Space Complexity :O(log n)

#quicksort #python #algorithm #coding #sorting