File quick_sort.py

Sorting Algorithms/quick_sort.py:None–None · view source on GitHub ↗

Source from the content-addressed store, hash-verified

1	"""
2	Quick sort is a divide and conquer algorithm
3	Steps:
4	1. We first select an element randomly which we call pivot element. We can choose any element as pivot element.

nothing calls this directly

quickSortFunction · 0.85

no test coverage detected