Quick Sort with Python

Quick Sort:
Quick Sort is also a divide-and-conquer algorithm.
It selects a "pivot" element and partitions the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. It then recursively sorts the sub-arrays.

Additionally, the code measures the execution time of the sorting process using the timeit module and prints the result.

The average time complexity is O(n log n) but can have a worst-case time complexity of O(n^2) if the pivot selection is not optimized.

#softwareengineer #interviewpreparation #dsa

[uniqueuday]

Include x>=pivot or x<=pivot in any one of lesser or greater!
Not in both...
It must be

greater=[x for x in mylist[1:] if x>=pivot] or x>pivot
lesser=[x for x in mylist[1:] if x<pivot] or x<=pivot.