#4 - 5% speed up for dual n+n/2+1

cpu/virtual/singlethread/java-benchmark-cli/performance-nbi/src/main/java/dev/obrienlabs/performance/nbi/Collatz.java

@@ -22,7 +22,7 @@ public static void main(String[] args) {
 		/**
 		  if even divide by 2, if odd multiply by 3 and add 1
 		  or for odd numbers do 2 steps to optimize (n + n/2 + 1) - because we truncate divides
-		  6% speed up for java, 20% for c, 
+		  6% speed up for Java, 20% for C, 6% for Go
 		*/
 		for(oddSearchCurrent = oddSearchStart; oddSearchCurrent < oddSearchEnd; oddSearchCurrent += oddSearchIncrement) {
 			current = oddSearchCurrent;