Commit34889fc

BruceLee569

authored and

poyea

committed

Update quick_sort.py (#928)

Use the last element as the first pivot, for it's easy to pop, this saves one element space.Iterating with the original list saves half the space, instead of generate a new shallow copy list by slice method.

1 parentbe4150c commit34889fcCopy full SHA for 34889fc

File tree

1 file changed

-7

lines changed

sorts
- quick_sort.py

1 file changed

-7

lines changed

`‎sorts/quick_sort.py‎`

Lines changed: 6 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,17 +33,16 @@ def quick_sort(collection):`
`33`	`33`	`iflength<=1:`
`34`	`34`	`returncollection`
`35`	`35`	`else:`
`36`		`-pivot=collection[0]`
`37`		`-# Modify the list comprehensions to reduce the number of judgments, the speed has increased by more than 50%.`
`38`		`-greater= []`
`39`		`-lesser= []`
`40`		`-forelementincollection[1:]:`
	`36`	`+# Use the last element as the first pivot`
	`37`	`+pivot=collection.pop()`
	`38`	`+# Put elements greater than pivot in greater list`
	`39`	`+# Put elements lesser than pivot in lesser list`
	`40`	`+greater,lesser= [], []`
	`41`	`+forelementincollection:`
`41`	`42`	`ifelement>pivot:`
`42`	`43`	`greater.append(element)`
`43`	`44`	`else:`
`44`	`45`	`lesser.append(element)`
`45`		`-# greater = [element for element in collection[1:] if element > pivot]`
`46`		`-# lesser = [element for element in collection[1:] if element <= pivot]`
`47`	`46`	`returnquick_sort(lesser)+ [pivot]+quick_sort(greater)`
`48`	`47`
`49`	`48`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit34889fc

File tree

1 file changed

1 file changed

`‎sorts/quick_sort.py‎`

0 commit comments