Commita7c77fa

authored

Create quicksort.py

Quick and dirty implementation of a quicksort algorithm

1 parent334a054 commita7c77faCopy full SHA for a7c77fa

File tree

+21

-0

lines changed

+21

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+defpartition(xs,start,end):`
	`2`	`+follower=leader=start`
	`3`	`+whileleader<end:`
	`4`	`+ifxs[leader]<=xs[end]:`
	`5`	`+xs[follower],xs[leader]=xs[leader],xs[follower]`
	`6`	`+follower+=1`
	`7`	`+leader+=1`
	`8`	`+xs[follower],xs[end]=xs[end],xs[follower]`
	`9`	`+returnfollower`
	`10`	`+`
	`11`	`+def_quicksort(xs,start,end):`
	`12`	`+ifstart>=end:`
	`13`	`+return`
	`14`	`+p=partition(xs,start,end)`
	`15`	`+_quicksort(xs,start,p-1)`
	`16`	`+_quicksort(xs,p+1,end)`
	`17`	`+`
	`18`	`+defquicksort(xs):`
	`19`	`+_quicksort(xs,0,len(xs)-1)`
	`20`	`+`
	`21`	`+# To use: create a list and send it to quicksort: quicksort(list placed here)`

Comments

(0)