Update README.markdown

gmoraleda · web-flow · commit 467503c623c0 · 2020-01-22T19:58:38.000+01:00
diff --git a/Count Occurrences/README.markdown b/Count Occurrences/README.markdown
@@ -55,9 +55,7 @@ func countOccurrences<T: Comparable>(of key: T, in a: [T]) -> Int {
 }
 ```
 
-Notice that the variables `leftBoundary` and `rightBoundary` are very similar to the [binary search](../Binary%20Search/) algorithm. The big difference is that they don't stop when they find the search key, but keep going.  Also, notice that we constrain the type `T` to be Comparable so that the algorithm can be applied to an 
-
-y of Strings, Ints or other types that conform to the Swift Comparable protocol.
+Notice that the variables `leftBoundary` and `rightBoundary` are very similar to the [binary search](../Binary%20Search/) algorithm. The big difference is that they don't stop when they find the search key, but keep going.  Also, notice that we constrain the type `T` to be Comparable so that the algorithm can be applied to an array of Strings, Ints or other types that conform to the Swift Comparable protocol.
 
 To test this algorithm, copy the code to a playground and then do:
 

Original file line number	Diff line number	Diff line change
`@@ -55,9 +55,7 @@ func countOccurrences<T: Comparable>(of key: T, in a: [T]) -> Int {`
`55`	`55`	`}`
`56`	`56`	```
`57`	`57`
`58`		-Notice that the variables `leftBoundary` and `rightBoundary` are very similar to the [binary search](../Binary%20Search/) algorithm. The big difference is that they don't stop when they find the search key, but keep going. Also, notice that we constrain the type `T` to be Comparable so that the algorithm can be applied to an
`59`		`-`
`60`		`-y of Strings, Ints or other types that conform to the Swift Comparable protocol.`
	`58`	+Notice that the variables `leftBoundary` and `rightBoundary` are very similar to the [binary search](../Binary%20Search/) algorithm. The big difference is that they don't stop when they find the search key, but keep going. Also, notice that we constrain the type `T` to be Comparable so that the algorithm can be applied to an array of Strings, Ints or other types that conform to the Swift Comparable protocol.
`61`	`59`
`62`	`60`	`To test this algorithm, copy the code to a playground and then do:`
`63`	`61`