Commit c22182f

authored

Merge pull request #914 from satbot/heapsort-typo

Fix typo in Heap Sort README lg -> log

2 parents 6ac4728 + 43181f5 commit c22182fCopy full SHA for c22182f

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,7 @@ As you can see, the largest items are making their way to the back. We repeat th`
`42`	`42`
`43`	`43`	`> Note: This process is very similar to [selection sort](../Selection%20Sort/), which repeatedly looks for the minimum item in the remainder of the array. Extracting the minimum or maximum value is what heaps are good at.`
`44`	`44`
`45`		`-Performance of heap sort is O(n lg n) in best, worst, and average case. Because we modify the array directly, heap sort can be performed in-place. But it is not a stable sort: the relative order of identical elements is not preserved.`
	`45`	`+Performance of heap sort is O(n log n) in best, worst, and average case. Because we modify the array directly, heap sort can be performed in-place. But it is not a stable sort: the relative order of identical elements is not preserved.`
`46`	`46`
`47`	`47`	`Here's how you can implement heap sort in Swift:`
`48`	`48`

Comments

(0)