tracks/kotlin/exercises/collatz-conjecture/README.md in trackler-2.2.1.45 vs tracks/kotlin/exercises/collatz-conjecture/README.md in trackler-2.2.1.46

- old
+ new

@@ -8,10 +8,11 @@ always reach 1 eventually. Given a number n, return the number of steps required to reach 1. ## Examples + Starting with n = 12, the steps would be as follows: 0. 12 1. 6 2. 3 @@ -22,10 +23,9 @@ 7. 4 8. 2 9. 1 Resulting in 9 steps. So for input n = 12, the return value would be 9. - ## Source