A couple of GoLang code improvements (algorithm-archivists#667)

* cleaner code for bogo_sort in go

* fix equal func for jarvis in go

Author: radu-munteanu

contents/bogo_sort/code/go/bogo_sort.go

@@ -8,10 +8,10 @@ import (
     "time"
 )
 
-func shuffle(a *[]int) {
-    for i := len(*a) - 1; i > 0; 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]
+        a[i], a[j] = a[j], a[i]
     }
 }
 
@@ -24,15 +24,15 @@ func isSorted(a []int) bool {
     return true
 }
 
-func bogoSort(a *[]int) {
-    for !isSorted(*a) {
+func bogoSort(a []int) {
+    for !isSorted(a) {
         shuffle(a)
     }
 }
 
 func main() {
     rand.Seed(time.Now().UnixNano())
     a := []int{1, 3, 4, 2}
-    bogoSort(&a)
+    bogoSort(a)
     fmt.Println(a)
 }

contents/jarvis_march/code/golang/jarvis.go

@@ -21,7 +21,7 @@ func leftMostPoint(points []point) point {
 }
 
 func (p point) equal(o point) bool {
-	return p.x == o.x && p.y == o.x
+	return p.x == o.x && p.y == o.y
 }
 
 func counterClockWise(p1, p2, p3 point) bool {