Skip to content

Implement quicksort algorithm in quicksort.phyton #297

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.

Sign up for GitHub

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
Kodurikeerthana07 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Implement quicksort algorithm in quicksort.phyton #297

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
10 changes: 10 additions & 0 deletions quicksort.phyton
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
def quicksort(arr):
if len(arr) <= 1:
return arr

pivot = arr[len(arr) // 2] # choose middle element as pivot
left = [x for x in arr if x < pivot] # elements smaller than pivot
middle = [x for x in arr if x == pivot] # elements equal to pivot
right = [x for x in arr if x > pivot] # elements greater than pivot

return quicksort(left) + middle + quicksort(right)