tracks/kotlin/exercises/binary-search/README.md in trackler-2.2.1.13 vs tracks/kotlin/exercises/binary-search/README.md in trackler-2.2.1.14

@@ -32,10 +32,10 @@
 
 A binary search halves the number of items to check with each iteration,
 so locating an item (or determining its absence) takes logarithmic time.
 A binary search is a dichotomic divide and conquer search algorithm.
 
-
+
 
 ## Source
 
 Wikipedia [http://en.wikipedia.org/wiki/Binary_search_algorithm](http://en.wikipedia.org/wiki/Binary_search_algorithm)