Skip to content

Instantly share code, notes, and snippets.

@mahmoudhossam
Created December 11, 2011 16:53
Show Gist options
  • Save mahmoudhossam/1461524 to your computer and use it in GitHub Desktop.
Save mahmoudhossam/1461524 to your computer and use it in GitHub Desktop.
A quicksort implementation in python.
def quicksort(lst):
for i in range(len(lst)):
for j in range(i,len(lst)):
if lst[i] > lst[j]:
lst[i], lst[j] = lst[j], lst[i]
return lst
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment