Resolve Liikt's PR review comments.

Author: christopherm99

contents/bogo_sort/code/go/main.go

@@ -3,37 +3,36 @@
 package main
 
 import (
-	"fmt"
-	"math/rand"
-	"time"
+    "fmt"
+    "math/rand"
+    "time"
 )
 
-func shuffle(a []int) []int {
-	rand.Seed(time.Now().UnixNano())
-	for i := len(a) - 1; i > 0; i-- {
-		j := rand.Intn(i + 1)
-		a[i], a[j] = a[j], a[i]
+func shuffle(a *[]int) {
+    for i := len(*a) - 1; i > 0; i-- {
+        j := rand.Intn(i + 1)
+        (*a)[i], (*a)[j] = (*a)[j], (*a)[i]
 	}
-	return a
 }
 
-func is_sorted(a []int) bool {
-	for i := 0; i < len(a)-1; i++ {
-		if a[i+1] < a[i] {
-			return false
-		}
-	}
-	return true
+func isSorted(a []int) bool {
+    for i := 0; i < len(a)-1; i++ {
+        if a[i+1] < a[i] {
+            return false
+        }
+    }
+    return true
 }
 
-func bogo_sort(a *[]int) {
-	for !is_sorted(*a) {
-		*a = shuffle(*a)
-	}
+func bogoSort(a *[]int) {
+    for !isSorted(*a) {
+        shuffle(a)
+    }
 }
 
 func main() {
-	a := []int{1, 3, 4, 2}
-	bogo_sort(&a)
-	fmt.Println(a)
+    rand.Seed(time.Now().UnixNano())
+    a := []int{1, 3, 4, 2}
+    bogoSort(&a)
+    fmt.Println(a)
 }