Commit 6ac4728

authored

Merge pull request #912 from gmoraleda/typo-fix

Typos corrected

2 parents 041c005 + f664af1 commit 6ac4728Copy full SHA for 6ac4728

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@ In code this looks as follows:`
`25`	`25`	`func countOccurrences<T: Comparable>(of key: T, in array: [T]) -> Int {`
`26`	`26`	`var leftBoundary: Int {`
`27`	`27`	`var low = 0`
`28`		`- var high = a.count`
	`28`	`+ var high = array.count`
`29`	`29`	`while low < high {`
`30`	`30`	`let midIndex = low + (high - low)/2`
`31`	`31`	`if a[midIndex] < key {`
`@@ -39,7 +39,7 @@ func countOccurrences<T: Comparable>(of key: T, in array: [T]) -> Int {`
`39`	`39`
`40`	`40`	`var rightBoundary: Int {`
`41`	`41`	`var low = 0`
`42`		`- var high = a.count`
	`42`	`+ var high = array.count`
`43`	`43`	`while low < high {`
`44`	`44`	`let midIndex = low + (high - low)/2`
`45`	`45`	`if a[midIndex] > key {`
`@@ -62,7 +62,7 @@ To test this algorithm, copy the code to a playground and then do:`
`62`	`62`	```swift
`63`	`63`	`let a = [ 0, 1, 1, 3, 3, 3, 3, 6, 8, 10, 11, 11 ]`
`64`	`64`
`65`		`-countOccurrencesOfKey(3, inArray: a) // returns 4`
	`65`	`+countOccurrences(of: 3, in: a) // returns 4`
`66`	`66`	```
`67`	`67`
`68`	`68`	`> Remember: If you use your own array, make sure it is sorted first!`

Comments

(0)