Apply gofmt

Author: kelvins

src/go/busca_binaria.go

@@ -21,9 +21,9 @@ func BinarySearch(seq []int, element, start, end int) int {
 }
 
 func main() {
-  value := 7
+	value := 7
 	slice := []int{1, 2, 3, 4, 5, 6, 7, 8, 9}
 	fmt.Println("Slice:", slice)
-  index := BinarySearch(slice, value, 0, len(slice))
+	index := BinarySearch(slice, value, 0, len(slice))
 	fmt.Println("Value", value, "found in index:", index)
 }

src/go/calculate_pi.go

@@ -20,7 +20,7 @@ func CalculatePi(terms []int) []float64 {
 }
 
 func main() {
-  slice := []int{10, 1000, 100000, 10000000}
+	slice := []int{10, 1000, 100000, 10000000}
 	fmt.Println("Slice:", slice)
 	fmt.Println("Pi:", CalculatePi(slice))
 }

src/go/cocktail_sort.go

@@ -34,7 +34,7 @@ func CocktailSort(slice []int) {
 }
 
 func main() {
-  slice := []int{1, 5, 8, 3, 7, 4, 9, 6, 2}
+	slice := []int{1, 5, 8, 3, 7, 4, 9, 6, 2}
 	fmt.Println("Slice:", slice)
 	CocktailSort(slice)
 	fmt.Println("CocktailSort:", slice)

src/go/comb_sort.go

@@ -27,7 +27,7 @@ func CombSort(slice []int) {
 }
 
 func main() {
-  slice := []int{6, 5, 8, 7, 3, 4, 2, 1, 9}
+	slice := []int{6, 5, 8, 7, 3, 4, 2, 1, 9}
 	fmt.Println("Slice:", slice)
 	CombSort(slice)
 	fmt.Println("CombSort:", slice)

src/go/counting_sort.go

@@ -38,7 +38,7 @@ func CountingSort(slice []int) {
 }
 
 func main() {
-  slice := []int{9, 5, 8, 7, 3, 2, 1, 6, 4}
+	slice := []int{9, 5, 8, 7, 3, 2, 1, 6, 4}
 	fmt.Println("Slice:", slice)
 	CountingSort(slice)
 	fmt.Println("CountingSort:", slice)

src/go/gnome_sort.go

@@ -18,7 +18,7 @@ func GnomeSort(slice []int) {
 }
 
 func main() {
-  slice := []int{2, 5, 1, 7, 4, 9, 8, 6, 3}
+	slice := []int{2, 5, 1, 7, 4, 9, 8, 6, 3}
 	fmt.Println("Slice:", slice)
 	GnomeSort(slice)
 	fmt.Println("GnomeSort:", slice)

src/go/hanoi.go

@@ -14,5 +14,5 @@ func Hanoi(pino0 int, pino2 int, pino1 int, numero int) {
 
 func main() {
 	fmt.Println("Torre de Hanoi:")
-  Hanoi(0, 2, 1, 3)
+	Hanoi(0, 2, 1, 3)
 }

src/go/heap_sort.go

@@ -82,7 +82,7 @@ func clearTree(slice []int, length int, position int) {
 }
 
 func main() {
-  slice := []int{6, 8, 7, 9, 1, 5, 4, 2, 3}
+	slice := []int{6, 8, 7, 9, 1, 5, 4, 2, 3}
 	fmt.Println("Slice:", slice)
 	HeapSort1(slice)
 	fmt.Println("HeapSort1:", slice)

src/go/insertion_sort.go

@@ -17,7 +17,7 @@ func InsertionSort(slice []int) {
 }
 
 func main() {
-  slice := []int{9, 8, 7, 5, 1, 2, 4, 3, 6}
+	slice := []int{9, 8, 7, 5, 1, 2, 4, 3, 6}
 	fmt.Println("Slice:", slice)
 	InsertionSort(slice)
 	fmt.Println("InsertionSort:", slice)

src/go/maximo_minimo.go

@@ -34,6 +34,6 @@ func MinimoMaximoRecursivo(vetor []int, minimo int, maximo int, indice int) {
 }
 
 func main() {
-  slice := []int{2, 3, 9, 1, 6, 8, 5}
-  MinimoMaximoRecursivo(slice, 999, 0, 0)
+	slice := []int{2, 3, 9, 1, 6, 8, 5}
+	MinimoMaximoRecursivo(slice, 999, 0, 0)
 }

src/go/merge_sort.go

@@ -50,7 +50,7 @@ func MergeSort(slice []int) {
 }
 
 func main() {
-  slice := []int{4, 6, 7, 1, 2, 3, 5, 9, 8}
+	slice := []int{4, 6, 7, 1, 2, 3, 5, 9, 8}
 	fmt.Println("Slice:", slice)
 	MergeSort(slice)
 	fmt.Println("MergeSort:", slice)

src/go/quick_sort.go

@@ -34,7 +34,7 @@ func split(slice []int, start int, end int) int {
 }
 
 func main() {
-  slice := []int{2, 1, 8, 4, 3, 7, 6, 5, 9}
+	slice := []int{2, 1, 8, 4, 3, 7, 6, 5, 9}
 	fmt.Println("Slice:", slice)
 	QuickSort(slice)
 	fmt.Println("QuickSort:", slice)

src/go/radix_sort.go

@@ -4,44 +4,44 @@ import "fmt"
 
 func RadixSort(slice []int) {
 
-  if len(slice) == 0 {
-    return
-  }
-
-  length := len(slice)
-  higher := slice[0]
-  exp := 1
-  var temp []int
-
-  for index := 0; index < length; index++ {
-    temp = append(temp, 0)
-    if slice[index] > higher {
-      higher = slice[index]
-    }
-  }
-
-  for higher/exp > 0 {
-    var bucket [10]int
-
-    for index := 0; index < length; index++ {
-      bucket[(slice[index]/exp) % 10] = bucket[(slice[index]/exp) % 10] + 1
-    }
-
-    for index := 1; index < 10; index++ {
-      bucket[index] = bucket[index] + bucket[index-1]
-    }
-
-    for index := length-1; index >= 0; index-- {
-      bucket[(slice[index] / exp) % 10] = bucket[(slice[index] / exp) % 10] - 1
-      temp[bucket[(slice[index] / exp) % 10]] = slice[index]
-    }
-
-    for index := 0; index < length; index++ {
-      slice[index] = temp[index]
-    }
-
-    exp = exp * 10
-  }
+	if len(slice) == 0 {
+		return
+	}
+
+	length := len(slice)
+	higher := slice[0]
+	exp := 1
+	var temp []int
+
+	for index := 0; index < length; index++ {
+		temp = append(temp, 0)
+		if slice[index] > higher {
+			higher = slice[index]
+		}
+	}
+
+	for higher/exp > 0 {
+		var bucket [10]int
+
+		for index := 0; index < length; index++ {
+			bucket[(slice[index]/exp)%10] = bucket[(slice[index]/exp)%10] + 1
+		}
+
+		for index := 1; index < 10; index++ {
+			bucket[index] = bucket[index] + bucket[index-1]
+		}
+
+		for index := length - 1; index >= 0; index-- {
+			bucket[(slice[index]/exp)%10] = bucket[(slice[index]/exp)%10] - 1
+			temp[bucket[(slice[index]/exp)%10]] = slice[index]
+		}
+
+		for index := 0; index < length; index++ {
+			slice[index] = temp[index]
+		}
+
+		exp = exp * 10
+	}
 }
 
 func main() {

src/go/selection_sort.go

@@ -19,7 +19,7 @@ func SelectionSort(slice []int) {
 }
 
 func main() {
-  slice := []int{1, 3, 2, 9, 7, 8, 5, 6, 4}
+	slice := []int{1, 3, 2, 9, 7, 8, 5, 6, 4}
 	fmt.Println("Slice:", slice)
 	SelectionSort(slice)
 	fmt.Println("SelectionSort:", slice)

src/go/shell_sort.go

@@ -27,7 +27,7 @@ func ShellSort(slice []int) {
 }
 
 func main() {
-  slice := []int{5, 1, 4, 2, 3, 6, 9, 7, 8}
+	slice := []int{5, 1, 4, 2, 3, 6, 9, 7, 8}
 	fmt.Println("Slice:", slice)
 	ShellSort(slice)
 	fmt.Println("ShellSort:", slice)