Upd Readmes (#145)

Author: igorwojda

src/test/kotlin/com/igorwojda/list/chunk/README.md

@@ -9,14 +9,14 @@ Given a list and chunk size, divide the list into multiple sub lists where each
 ## Examples
 
 ```kotlin
-chunk([1, 2, 3, 4], 2) --> [[ 1, 2], [3, 4]]
+chunk([1, 2, 3, 4], 2) // [[ 1, 2], [3, 4]]
 
-chunk([1, 2, 3, 4, 5], 2) --> [[ 1, 2], [3, 4], [5]]
+chunk([1, 2, 3, 4, 5], 2) // [[ 1, 2], [3, 4], [5]]
 
-chunk([1, 2, 3, 4, 5, 6, 7, 8], 3) --> [[ 1, 2, 3], [4, 5, 6], [7, 8]]
+chunk([1, 2, 3, 4, 5, 6, 7, 8], 3) // [[ 1, 2, 3], [4, 5, 6], [7, 8]]
 
-chunk([1, 2, 3, 4, 5], 4) --> [[ 1, 2, 3, 4], [5]]
+chunk([1, 2, 3, 4, 5], 4) // [[ 1, 2, 3, 4], [5]]
 
-chunk([1, 2, 3, 4, 5], 10) --> [[ 1, 2, 3, 4, 5]]
+chunk([1, 2, 3, 4, 5], 10) // [[ 1, 2, 3, 4, 5]]
 ```
 

src/test/kotlin/com/igorwojda/list/sort/bubblesort/README.md

@@ -19,28 +19,28 @@ Sort `[5, 1, 4, 2, 8]`
 
 **First Pass**
  ```kotlin
-[5, 1, 4, 2, 8] -> [1, 5, 4, 2, 8] Compares the first two elements, and swap since 5 > 1
-[1, 5, 4, 2, 8] -> [1, 4, 5, 2, 8] Swap since 5 > 4 
-[1, 4, 5, 2, 8] -> [1, 4, 2, 5, 8] Swap since 5 > 2 
-[1, 4, 2, 5, 8] -> [1, 4, 2, 5, 8] Now, since these elements are already in order (8 > 5), algorithm does not swap them
+[5, 1, 4, 2, 8] // [1, 5, 4, 2, 8] Compares the first two elements, and swap since 5 > 1
+[1, 5, 4, 2, 8] // [1, 4, 5, 2, 8] Swap since 5 > 4 
+[1, 4, 5, 2, 8] // [1, 4, 2, 5, 8] Swap since 5 > 2 
+[1, 4, 2, 5, 8] // [1, 4, 2, 5, 8] Now, since these elements are already in order (8 > 5), algorithm does not swap them
 ```
 
 **Second Pass**
 ```kotlin
-[1, 4, 2, 5, 8] -> [1, 4, 2, 5, 8] 
-[1, 4, 2, 5, 8] -> [1, 2, 4, 5, 8] Swap since 4 > 2 
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8] 
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8]
+[1, 4, 2, 5, 8] // [1, 4, 2, 5, 8] 
+[1, 4, 2, 5, 8] // [1, 2, 4, 5, 8] Swap since 4 > 2 
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8] 
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8]
 ```
 
 Now, the list is already sorted, but the algorithm does not know if it is completed. The algorithm needs one whole pass
 without any swap to know it is sorted
 
 **Third Pass**
 ```kotlin
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8] 
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8] 
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8] 
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8]
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8] 
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8] 
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8] 
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8]
 ```
 

src/test/kotlin/com/igorwojda/list/sort/selectionsort/README.md

@@ -16,15 +16,15 @@ Sort `[5, 1, 4, 2, 8]`
 
 Find the minimum element in sub-list indexes 1...4 and place it at index 0
 ```kotlin
-[5, 1, 4, 2, 8] -> [1, 5, 4, 2, 8] Swap since 1 < 5
+[5, 1, 4, 2, 8] // [1, 5, 4, 2, 8] Swap since 1 < 5
 ```
 
 Find the minimum element in sub-list indexes 2...4 and place it at index 1
 ```kotlin
-[1, 5, 4, 2, 8] -> [1, 2, 4, 5, 8] Swap since 2 < 4
+[1, 5, 4, 2, 8] // [1, 2, 4, 5, 8] Swap since 2 < 4
 ```
 
 Find the minimum element in sub-list indexes 3...4 and place it at index 2
 ```kotlin
-[1, 2, 4, 5, 8] -> [1, 2, 4, 5, 8] No swap since 5 < 8
+[1, 2, 4, 5, 8] // [1, 2, 4, 5, 8] No swap since 5 < 8
 ```