Removing color from utils and sorting algorithms

Author: AAVision

bubble_sort.go

@@ -6,11 +6,11 @@ func bubbleSortVisualizer(arr []int, delay time.Duration) {
 	n := len(arr)
 	for i := 0; i < n-1; i++ {
 		for j := 0; j < n-i-1; j++ {
-			visualizeIteration(White, arr, j, j+1, delay)
+			visualizeIteration(arr, j, j+1, delay)
 			if arr[j] > arr[j+1] {
-				visualizeIteration(LightYellow, arr, j, j+1, delay)
+				visualizeIteration(arr, j, j+1, delay)
 				arr[j], arr[j+1] = arr[j+1], arr[j]
-				visualizeIteration(LightBlue, arr, j, j+1, delay)
+				visualizeIteration(arr, j, j+1, delay)
 			}
 		}
 	}

cocktail_shaker_sort.go

@@ -8,21 +8,21 @@ func cocktailShakerSortVisualizer(arr []int, delay time.Duration) {
 
 	for left <= right {
 		for i := left; i < right; i++ {
-			visualizeIteration(White, arr, i, i+1, delay)
+			visualizeIteration(arr, i, i+1, delay)
 			if arr[i] > arr[i+1] {
-				visualizeIteration(LightYellow, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 				arr[i], arr[i+1] = arr[i+1], arr[i]
-				visualizeIteration(LightBlue, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 			}
 		}
 		right--
 
 		for i := right; i > left; i-- {
-			visualizeIteration(White, arr, i-1, i, delay)
+			visualizeIteration(arr, i-1, i, delay)
 			if arr[i-1] > arr[i] {
-				visualizeIteration(LightYellow, arr, i-1, i, delay)
+				visualizeIteration(arr, i-1, i, delay)
 				arr[i], arr[i-1] = arr[i-1], arr[i]
-				visualizeIteration(LightBlue, arr, i-1, i, delay)
+				visualizeIteration(arr, i-1, i, delay)
 			}
 		}
 		left++

comb_sort.go

@@ -12,11 +12,11 @@ func combSortVisualizer(arr []int, delay time.Duration) {
 		swapped = false
 
 		for i := 0; i < n-gap; i++ {
-			visualizeIteration(White, arr, i, i+gap, delay)
+			visualizeIteration(arr, i, i+gap, delay)
 			if arr[i] > arr[i+gap] {
-				visualizeIteration(LightYellow, arr, i, i+gap, delay)
+				visualizeIteration(arr, i, i+gap, delay)
 				arr[i], arr[i+gap] = arr[i+gap], arr[i]
-				visualizeIteration(LightBlue, arr, i, i+gap, delay)
+				visualizeIteration(arr, i, i+gap, delay)
 				swapped = true
 			}
 		}

gnome_sort.go

@@ -7,12 +7,12 @@ func gnomeSortVisualizer(arr []int, delay time.Duration) {
 
 	for i < len(arr) {
 		if i == 0 || arr[i] >= arr[i-1] {
-			visualizeIteration(White, arr, i-1, i, delay)
+			visualizeIteration(arr, i-1, i, delay)
 			i++
 		} else {
-			visualizeIteration(LightYellow, arr, i-1, i, delay)
+			visualizeIteration(arr, i-1, i, delay)
 			arr[i], arr[i-1] = arr[i-1], arr[i]
-			visualizeIteration(LightBlue, arr, i-1, i, delay)
+			visualizeIteration(arr, i-1, i, delay)
 			i--
 			if i == 0 {
 				i = 1

insertion_sort.go

@@ -7,11 +7,11 @@ import (
 func insertionSortVisualizer(arr []int, delay time.Duration) {
 	for i := 1; i < len(arr); i++ {
 		j := i
-		visualizeIteration(White, arr, j-1, j, delay)
+		visualizeIteration(arr, j-1, j, delay)
 		for j > 0 && arr[j] < arr[j-1] {
-			visualizeIteration(LightYellow, arr, j-1, j, delay)
+			visualizeIteration(arr, j-1, j, delay)
 			arr[j], arr[j-1] = arr[j-1], arr[j]
-			visualizeIteration(LightBlue, arr, j-1, j, delay)
+			visualizeIteration(arr, j-1, j, delay)
 			j--
 		}
 	}

odd_even_sort.go

@@ -9,21 +9,21 @@ func oddEvenSortVisualizer(arr []int, delay time.Duration) {
 	for !sorted {
 		sorted = true
 		for i := 1; i <= n-2; i += 2 {
-			visualizeIteration(White, arr, i, i+1, delay)
+			visualizeIteration(arr, i, i+1, delay)
 			if arr[i] > arr[i+1] {
-				visualizeIteration(LightYellow, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 				arr[i], arr[i+1] = arr[i+1], arr[i]
-				visualizeIteration(LightBlue, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 				sorted = false
 			}
 		}
 
 		for i := 0; i <= n-2; i += 2 {
-			visualizeIteration(White, arr, i, i+1, delay)
+			visualizeIteration(arr, i, i+1, delay)
 			if arr[i] > arr[i+1] {
-				visualizeIteration(LightYellow, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 				arr[i], arr[i+1] = arr[i+1], arr[i]
-				visualizeIteration(LightBlue, arr, i, i+1, delay)
+				visualizeIteration(arr, i, i+1, delay)
 				sorted = false
 			}
 		}

selection_sort.go

@@ -8,13 +8,13 @@ func selectionSortVisualizer(arr []int, delay time.Duration) {
 	for i := 0; i < len(arr); i++ {
 		min := i
 		for j := i + 1; j < len(arr); j++ {
-			visualizeIteration(White, arr, i, j, delay)
+			visualizeIteration(arr, i, j, delay)
 			if arr[j] < arr[min] {
-				visualizeIteration(LightYellow, arr, i, j, delay)
+				visualizeIteration(arr, i, j, delay)
 				min = j
 			}
 		}
 		arr[i], arr[min] = arr[min], arr[i]
-		visualizeIteration(LightBlue, arr, i, min, delay)
+		visualizeIteration(arr, i, min, delay)
 	}
 }

utils.go

@@ -13,12 +13,6 @@ import (
 
 type Color int
 
-const (
-	White Color = iota
-	LightYellow
-	LightBlue
-)
-
 func generateRandomArray(size int) []int {
 	arr := make([]int, size)
 	for i := 0; i < len(arr); i++ {
@@ -42,22 +36,22 @@ func clearConsole() {
 	}
 }
 
-func printColoredArray(c Color, array []int, idx1, idx2 int) {
+func printColoredArray(array []int, idx1, idx2 int) {
 	fmt.Print("[")
 	for i, _ := range array {
 		if idx1 == i {
 			fmt.Print(color.OpUnderscore.Sprint(color.LightYellow.Sprint(array[idx1]), " "))
 		} else if idx2 == i {
 			fmt.Print(color.OpUnderscore.Sprint(color.LightYellow.Sprint(array[idx2]), " "))
 		} else {
-			fmt.Print(color.OpUnderscore.Sprint(array[i], " "))
+			fmt.Print(color.Sprint(array[i], " "))
 		}
 	}
 	fmt.Println("]")
 }
 
-func visualizeIteration(c Color, array []int, idx1, idx2 int, delay time.Duration) {
-	printColoredArray(c, array, idx1, idx2)
+func visualizeIteration(array []int, idx1, idx2 int, delay time.Duration) {
+	printColoredArray(array, idx1, idx2)
 	time.Sleep(delay)
 	clearConsole()
 }