Skip to content

Commit 6217ace

Browse files
jcla1jcla1
committed
go fmt 'ed all go files in repo
1 parent dff36d9 commit 6217ace

9 files changed

Lines changed: 146 additions & 146 deletions

File tree

‎Bogosort/Go/jcla1/bogosort_test.go‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,4 +27,4 @@ func TestBogosort(t *testing.T) {
2727
t.Errorf("Bogosort(%v) = %v", arr, result)
2828
}
2929
}
30-
}
30+
}

‎Bubble_Sort/Go/jcla1/bubblesort_test.go‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,24 @@ package bubblesort
33
import "testing"
44

55
func TestBubbleSort(t *testing.T) {
6-
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
6+
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
77

8-
var result []int
8+
var result []int
99

10-
for _, arr := range arrs {
11-
result = BubbleSort(arr)
12-
if !isSorted(result) {
13-
t.Errorf("BubbleSort(%v) = %v", arr, result)
14-
}
15-
}
10+
for _, arr := range arrs {
11+
result = BubbleSort(arr)
12+
if !isSorted(result) {
13+
t.Errorf("BubbleSort(%v) = %v", arr, result)
14+
}
15+
}
1616
}
1717

1818
func isSorted(arr []int) bool {
19-
for i := 1; i < len(arr); i++ {
20-
if arr[i-1] > arr[i] {
21-
return false
22-
}
23-
}
19+
for i := 1; i < len(arr); i++ {
20+
if arr[i-1] > arr[i] {
21+
return false
22+
}
23+
}
2424

25-
return true
26-
}
25+
return true
26+
}

‎Knuth_Morris_Pratt/Go/jcla1/kmp.go‎

Lines changed: 42 additions & 42 deletions
Original file line numberDiff line numberDiff line change
@@ -5,48 +5,48 @@ package kmp
55
// and n is the length of the text to search in
66

77
func KMPSearch(txt, word string) int {
8-
m, i := 0, 0
9-
table := kmpTable(word)
10-
11-
for (m+i) < len(txt) {
12-
if word[i] == txt[m + i] {
13-
if i == len(word) - 1 {
14-
return m
15-
}
16-
17-
i += 1
18-
} else {
19-
m += i - table[i]
20-
if table[i] > -1 {
21-
i = table[i]
22-
} else {
23-
i = 0
24-
}
25-
}
26-
}
27-
28-
// We haven't found the word
29-
return len(txt)
8+
m, i := 0, 0
9+
table := kmpTable(word)
10+
11+
for (m + i) < len(txt) {
12+
if word[i] == txt[m+i] {
13+
if i == len(word)-1 {
14+
return m
15+
}
16+
17+
i += 1
18+
} else {
19+
m += i - table[i]
20+
if table[i] > -1 {
21+
i = table[i]
22+
} else {
23+
i = 0
24+
}
25+
}
26+
}
27+
28+
// We haven't found the word
29+
return len(txt)
3030
}
3131

3232
func kmpTable(word string) []int {
33-
pos, cnd := 2, 0
34-
table := make([]int, len(word)+1)
35-
36-
table[0], table[1] = -1, 0
37-
38-
for pos < len(word) {
39-
if word[pos - 1] == word[cnd] {
40-
cnd += 1
41-
table[pos] = cnd
42-
pos += 1
43-
} else if cnd > 0 {
44-
cnd = table[cnd]
45-
} else {
46-
table[pos] = 0
47-
pos += 1
48-
}
49-
}
50-
51-
return table
52-
}
33+
pos, cnd := 2, 0
34+
table := make([]int, len(word)+1)
35+
36+
table[0], table[1] = -1, 0
37+
38+
for pos < len(word) {
39+
if word[pos-1] == word[cnd] {
40+
cnd += 1
41+
table[pos] = cnd
42+
pos += 1
43+
} else if cnd > 0 {
44+
cnd = table[cnd]
45+
} else {
46+
table[pos] = 0
47+
pos += 1
48+
}
49+
}
50+
51+
return table
52+
}

‎Knuth_Morris_Pratt/Go/jcla1/kmp_test.go‎

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -3,16 +3,16 @@ package kmp
33
import "testing"
44

55
func TestKNPSearch(t *testing.T) {
6-
texts := []string{"ABC ABCDAB ABCDABCDABDE", "0011001011", "agoago go go golang gos"}
7-
words := []string{"ABCDABD", "0101", "go go go golang"}
8-
expected := []int{15, 5, 4}
6+
texts := []string{"ABC ABCDAB ABCDABCDABDE", "0011001011", "agoago go go golang gos"}
7+
words := []string{"ABCDABD", "0101", "go go go golang"}
8+
expected := []int{15, 5, 4}
99

10-
var result int
10+
var result int
1111

12-
for i, exp := range expected {
13-
result = KMPSearch(texts[i], words[i])
14-
if result != exp {
15-
t.Errorf("KNPSearch(texts[%d], words[%d]) = %d, wanted %d", i, i, result, exp)
16-
}
17-
}
18-
}
12+
for i, exp := range expected {
13+
result = KMPSearch(texts[i], words[i])
14+
if result != exp {
15+
t.Errorf("KNPSearch(texts[%d], words[%d]) = %d, wanted %d", i, i, result, exp)
16+
}
17+
}
18+
}

‎Merge_Sort/Go/jcla1/merge_sort_test.go‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,24 @@ package mergesort
33
import "testing"
44

55
func TestMergeSort(t *testing.T) {
6-
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
6+
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
77

8-
var result []int
8+
var result []int
99

10-
for _, arr := range arrs {
11-
result = MergeSort(arr)
12-
if !isSorted(result) {
13-
t.Errorf("MergeSort(%v) = %v", arr, result)
14-
}
15-
}
10+
for _, arr := range arrs {
11+
result = MergeSort(arr)
12+
if !isSorted(result) {
13+
t.Errorf("MergeSort(%v) = %v", arr, result)
14+
}
15+
}
1616
}
1717

1818
func isSorted(arr []int) bool {
19-
for i := 1; i < len(arr); i++ {
20-
if arr[i-1] > arr[i] {
21-
return false
22-
}
23-
}
19+
for i := 1; i < len(arr); i++ {
20+
if arr[i-1] > arr[i] {
21+
return false
22+
}
23+
}
2424

25-
return true
26-
}
25+
return true
26+
}

‎Quick_Sort/Go/jcla1/quick_sort.go‎

Lines changed: 17 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,24 @@ package quickSort
33
import "math/rand"
44

55
func QuickSort(arr []int) []int {
6-
if len(arr) < 2 {
7-
return arr
8-
}
6+
if len(arr) < 2 {
7+
return arr
8+
}
99

10-
pivotIndex := rand.Intn(len(arr))
11-
pivot := arr[pivotIndex]
10+
pivotIndex := rand.Intn(len(arr))
11+
pivot := arr[pivotIndex]
1212

13-
arr = append(arr[:pivotIndex], arr[pivotIndex+1:]...)
14-
less, greater := make([]int, 0), make([]int, 0)
13+
arr = append(arr[:pivotIndex], arr[pivotIndex+1:]...)
14+
less, greater := make([]int, 0), make([]int, 0)
1515

16-
for _, v := range arr {
17-
if v < pivot {
18-
less = append(less, v)
19-
} else {
20-
greater = append(greater, v)
21-
}
22-
}
16+
for _, v := range arr {
17+
if v < pivot {
18+
less = append(less, v)
19+
} else {
20+
greater = append(greater, v)
21+
}
22+
}
2323

24-
// Merge the recursively sorted slices back together
25-
return append(append(QuickSort(less), pivot), QuickSort(greater)...)
26-
}
24+
// Merge the recursively sorted slices back together
25+
return append(append(QuickSort(less), pivot), QuickSort(greater)...)
26+
}

‎Quick_Sort/Go/jcla1/quick_sort_test.go‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,24 @@ package quickSort
33
import "testing"
44

55
func TestQuickSort(t *testing.T) {
6-
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
6+
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
77

8-
var result []int
8+
var result []int
99

10-
for _, arr := range arrs {
11-
result = QuickSort(arr)
12-
if !isSorted(result) {
13-
t.Errorf("QuickSort(%v) = %v", arr, result)
14-
}
15-
}
10+
for _, arr := range arrs {
11+
result = QuickSort(arr)
12+
if !isSorted(result) {
13+
t.Errorf("QuickSort(%v) = %v", arr, result)
14+
}
15+
}
1616
}
1717

1818
func isSorted(arr []int) bool {
19-
for i := 1; i < len(arr); i++ {
20-
if arr[i-1] > arr[i] {
21-
return false
22-
}
23-
}
19+
for i := 1; i < len(arr); i++ {
20+
if arr[i-1] > arr[i] {
21+
return false
22+
}
23+
}
2424

25-
return true
26-
}
25+
return true
26+
}

‎Selection_Sort/Go/jcla1/selection_sort.go‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,19 @@
11
package selectionSort
22

33
func SelectionSort(arr []int) []int {
4-
length := len(arr)
5-
var minIndex int
4+
length := len(arr)
5+
var minIndex int
66

7-
for i := range arr {
8-
minIndex = i
9-
for j := i; j < length; j++ {
10-
if arr[j] < arr[minIndex] {
11-
minIndex = j
12-
}
13-
}
14-
if minIndex != i {
15-
arr[i], arr[minIndex] = arr[minIndex], arr[i]
16-
}
17-
}
18-
return arr
19-
}
7+
for i := range arr {
8+
minIndex = i
9+
for j := i; j < length; j++ {
10+
if arr[j] < arr[minIndex] {
11+
minIndex = j
12+
}
13+
}
14+
if minIndex != i {
15+
arr[i], arr[minIndex] = arr[minIndex], arr[i]
16+
}
17+
}
18+
return arr
19+
}

‎Selection_Sort/Go/jcla1/selection_sort_test.go‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,24 @@ package selectionSort
33
import "testing"
44

55
func TestSelectionSort(t *testing.T) {
6-
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
6+
arrs := [][]int{[]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}, []int{2, 3, 7, -5, -1, 4, -10}}
77

8-
var result []int
8+
var result []int
99

10-
for _, arr := range arrs {
11-
result = SelectionSort(arr)
12-
if !isSorted(result) {
13-
t.Errorf("SelectionSort(%v) = %v", arr, result)
14-
}
15-
}
10+
for _, arr := range arrs {
11+
result = SelectionSort(arr)
12+
if !isSorted(result) {
13+
t.Errorf("SelectionSort(%v) = %v", arr, result)
14+
}
15+
}
1616
}
1717

1818
func isSorted(arr []int) bool {
19-
for i := 1; i < len(arr); i++ {
20-
if arr[i-1] > arr[i] {
21-
return false
22-
}
23-
}
19+
for i := 1; i < len(arr); i++ {
20+
if arr[i-1] > arr[i] {
21+
return false
22+
}
23+
}
2424

25-
return true
26-
}
25+
return true
26+
}

0 commit comments

Comments
 (0)