Commita667d82

authored

fix bug

1 parenteceace8 commita667d82Copy full SHA for a667d82

File tree

+14

-15

lines changed

+14

-15

lines changed

Lines changed: 14 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,23 +5,22 @@ def heapSort(alist):`
`5`	`5`	`output= []`
`6`	`6`	`foriinrange(length):`
`7`	`7`	`tempLen=len(alist)`
`8`		`-forjinrange((tempLen-1)//2,-1,-1):`
`9`		`-k=j`
`10`		`-v,heap=alist[k],False`
`11`		`-whilenotheapand2*k<=tempLen-1:`
`12`		`-index=2*k`
`13`		`-ifindex<tempLen-1:`
`14`		`-ifalist[index]<alist[index+1]:`
`15`		`-index+=1`
`16`		`-ifv>=alist[index]:`
	`8`	`+forjinrange(tempLen//2-1,-1,-1):`
	`9`	`+preIndex=j`
	`10`	`+preVal,heap=alist[preIndex],False`
	`11`	`+while2*preIndex<=tempLen-1andnotheap:`
	`12`	`+curIndex=2*preIndex+1`
	`13`	`+ifcurIndex<tempLen-1:`
	`14`	`+ifalist[curIndex]<alist[curIndex+1]:`
	`15`	`+curIndex+=1`
	`16`	`+ifpreVal>=alist[curIndex]:`
`17`	`17`	`heap=True`
`18`	`18`	`else:`
`19`		`-alist[k]=alist[index]`
`20`		`-k=index`
`21`		`-alist[k]=v`
`22`		`-heapVal=alist.pop(0)`
`23`		`-output.insert(0,heapVal)`
	`19`	`+alist[preIndex]=alist[curIndex]`
	`20`	`+preIndex=curIndex`
	`21`	`+alist[preIndex]=preVal`
	`22`	`+output.insert(0,alist.pop(0))`
`24`	`23`	`returnoutput`
`25`	`24`
`26`	`25`	`test= [2,6,5,9,10,3,7]`
`27`		`-print(heapSort(test))`
	`26`	`+print(heapSort(test))`

Comments

(0)