Update bubbleSort.go

Move func bubbleSort to the top.

Author: evbacher

sorting/bubbleSort.go

@@ -32,7 +32,26 @@ func main() {
     checkSorted(arr)
 }
 
+// Sort an array of integers.
+func bubbleSort(arr []int) {
+    // If we had to swap, the array is not sorted yet.
+    swapped := true
+    for swapped {
+        // Assume sorted to begin with. May change during loop.
+        swapped = false
+        // Check next element, swap if necessary.
+        for i,l := 0,len(arr); i < l-1; i++ {
+            if arr[i] > arr[i+1] {
+                arr[i], arr[i+1] = arr[i+1], arr[i]
+                swapped = true
+            }
+        }
+    }
+}
+
+// Returns a slice of numItems random ints, up to max.
 func makeRandomSlice(numItems, max int) []int {
+    // We are calling this an array, but it's actually a slice.
     arr := make([]int, numItems)
 
     // Seed the random number generator, otherwise it will generate the same set.
@@ -44,6 +63,7 @@ func makeRandomSlice(numItems, max int) []int {
     return arr
 }
 
+// Prints the first numItems of the slice arr.
 func printSlice(arr []int, numItems int) {
     if (len(arr) < numItems) {
         numItems = len(arr)
@@ -54,6 +74,7 @@ func printSlice(arr []int, numItems int) {
     fmt.Println()
 }
 
+// Checks to see if arr is sorted.
 func checkSorted(arr []int) {
     for i := 0; i < len(arr)-1; i++ {
         if arr[i] <= arr[i+1] {
@@ -64,20 +85,3 @@ func checkSorted(arr []int) {
     }
     fmt.Println("The array is sorted")
 }
-
-func bubbleSort(arr []int) {
-    // If we had to swap, the array is not sorted yet.
-    swapped := true
-    for swapped {
-        // Assume sorted to begin with. May change during loop.
-        swapped = false
-        // Check next element, swap if necessary.
-        for i,l := 0,len(arr); i < l-1; i++ {
-            if arr[i] > arr[i+1] {
-                arr[i], arr[i+1] = arr[i+1], arr[i]
-                swapped = true
-            }
-        }
-    }
-}
-