TheAlgorithms
Quick sort algorithm by using python
This repository contains a Python implementation of the Quick Sort algorithm. Quick Sort is an efficient, comparison-based sorting algorithm that follows the divide-and-conquer approach. It picks a pivot element, partitions the array into elements less than the pivot, equal to the pivot, and greater than the pivot, then recursively sorts the sub-arrays.
Features: Pivot Selection: The algorithm uses the middle element as the pivot to partition the array. Recursive Sorting: The array is recursively divided into smaller sub-arrays, which are sorted independently. Time Complexity: Average-case time complexity is O(n log n), and worst-case time complexity is O(n²), but with randomized pivot selection, the average-case performance is optimal.
Describe your change: Add an algorithm: Quick Sort Algorithm in Python This pull request introduces a Python implementation of the Quick Sort algorithm, a popular divide-and-conquer sorting technique. The implementation uses the middle element as the pivot and recursively sorts the sub-arrays. It provides efficient average-case performance with O(n log n) complexity. Checklist: I have read CONTRIBUTING.md. This pull request is all my own work -- I have not plagiarized. I know that pull requests will not be merged if they fail the automated tests. This PR only changes one algorithm file. To ease review, I have opened this PR solely for the Quick Sort algorithm. All new Python files are placed inside an existing directory: sorts/. All filenames are in all lowercase characters with no spaces or dashes: quick_sort.py. All functions and variable names follow Python naming conventions. All function parameters and return values are annotated with Python type hints. All functions have doctests that pass the automated testing. This algorithm includes a URL pointing to its explanation: Wikipedia: Quick Sort.
