init project

Author: dimasdh842

bubbleSort/bubbleSort.go

@@ -0,0 +1,45 @@
+package bubbleSort
+
+func sweep(numbers []int, prevPhases int, reversed bool) bool {
+	var N int = len(numbers)
+	var firstIndex int = 0
+	var secondIndex int = 1
+	var didSwap bool
+
+	for secondIndex < (N - prevPhases) {
+		var firstNumber int = numbers[firstIndex]
+		var secondNumber int = numbers[secondIndex]
+
+		if reversed {
+			if firstNumber < secondNumber {
+				numbers[firstIndex] = secondNumber
+				numbers[secondIndex] = firstNumber
+				didSwap = true
+			}
+
+		} else {
+			if firstNumber > secondNumber {
+				numbers[firstIndex] = secondNumber
+				numbers[secondIndex] = firstNumber
+				didSwap = true
+			}
+
+		}
+
+		firstIndex++
+		secondIndex++
+	}
+
+	return didSwap
+}
+
+func Sort(numbers []int, reversed bool) []int {
+	N := len(numbers)
+	i := 0
+	for i < N {
+		sweep(numbers, i, reversed)
+		i++
+	}
+
+	return numbers
+}

bubbleSort/bubbleSort_test.go

@@ -0,0 +1,20 @@
+package bubbleSort
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestSort(t *testing.T) {
+	result := Sort([]int{5, 2, 4, 3, 1, 0}, true)
+
+	if !reflect.DeepEqual(result, []int{5, 4, 3, 2, 1, 0}) {
+		t.Errorf("%v must be the same with [5, 4, 3, 2, 1, 0] ", result)
+	}
+
+	result = Sort([]int{5, 2, 4, 3, 1, 0}, false)
+
+	if !reflect.DeepEqual(result, []int{0, 1, 2, 3, 4, 5}) {
+		t.Errorf("%v must be the same with [0, 1, 2, 3, 4, 5]", result)
+	}
+}

go.mod

@@ -0,0 +1,3 @@
+module github.com/dimasdh842/sorting_algorithm
+
+go 1.15

main.go

@@ -0,0 +1,26 @@
+package main
+
+import (
+	"fmt"
+	"reflect"
+
+	"github.com/dimasdh842/sorting_algorithm/bubbleSort"
+)
+
+func main() {
+
+	numbers := []int{5, 1, 4, 3, 2, 0}
+	result := bubbleSort.Sort(numbers, true)
+	fmt.Println(result)
+	fmt.Println(numbers)
+
+	// sliceA := []int{1, 2, 3, 11}
+	// sliceB := []int{1, 2, 3, 4}
+
+	if reflect.DeepEqual(result, numbers) {
+		fmt.Println("Slices are equal")
+	} else {
+		fmt.Println("Slices are not equal")
+	}
+
+}