Skip to content

Create Quick_Sort.py #30

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions Quick_Sort.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
def quick_sort(arr):
if len(arr) <= 1:
return arr

pivot = arr[-1]
left = [] # Elements less than the pivot
right = [] # Elements greater than the pivot
middle = [] # Elements equal to the pivot

for x in arr:
if x < pivot:
left.append(x) # Add to left if less than pivot
elif x > pivot:
right.append(x) # Add to right if greater than pivot
else:
middle.append(x) # Add to middle if equal to pivot

return quick_sort(left) + middle + quick_sort(right)