first commit

Author: Hcode30

arrays.go

@@ -0,0 +1,24 @@
+package main
+
+import "math/rand"
+
+func getRandomArr(size int) []int {
+	arr := make([]int, size)
+	for i := 0; i < size; i++ {
+		arr[i] = rand.Intn(size * 10)
+	}
+	return arr
+}
+
+func printArr(arr []int) {
+	print("[")
+	for i, v := range arr {
+		if i == len(arr)-1 {
+			print(v)
+		} else {
+			print(v, ",")
+		}
+	}
+	println("]")
+	println("length of array:", len(arr))
+}

go.mod

@@ -0,0 +1,3 @@
+module prime
+
+go 1.21.4

main.go

@@ -0,0 +1,12 @@
+package main
+
+func main() {
+	// randomArr := getRandomArr(1000)
+	// crystallBall := []bool{false, false, false, false, false, false, false, false, false, false, true, true, true, true}
+	//     TestBinaryCrystalBall(crystallBall)
+
+	// arr := []int{15, 2, 17, 0, 66, 5, 22, 9, 7}
+	// TestBubbleSort(randomArr)
+	// printArr(randomArr)
+
+}

search.go

@@ -0,0 +1,63 @@
+package main
+
+import (
+	"math"
+)
+
+
+func linearSearch(arr []int, value int) int {
+	for i, v := range arr {
+		if v == value {
+			return i
+		}
+	}
+	return -1
+}
+
+func BinarySearch(arr []int, target int) int {
+	low, high := 0, len(arr)-1
+	for low <= high {
+		mid := low + (high-low)/2
+		if arr[mid] == target {
+			return mid
+		} else if target > arr[mid] {
+			low = mid + 1
+		} else {
+			high = mid - 1
+		}
+	}
+	return -1
+}
+
+func SearchInt(arr []int, val int, ordered bool) int {
+	if ordered {
+		if len(arr) > 10000 {
+			return TestBinarySearch(arr, val)
+		} else {
+			return TestLinearSearch(arr, val)
+		}
+	}
+	return TestLinearSearch(arr, val)
+}
+
+func BinaryCrystalBall(breaks []bool) int {
+	jumpAmount := int(math.Floor(math.Sqrt(float64(len(breaks)))))
+	i := jumpAmount
+	for ; i < len(breaks); i += jumpAmount {
+		if breaks[i] {
+			break
+		}
+	}
+
+	i -= jumpAmount
+	for j := 0; j < jumpAmount && i < len(breaks); j++ {
+		if breaks[i] {
+			return i
+		}
+		i++
+	}
+
+	return -1
+
+}
+

sort.go

@@ -0,0 +1,24 @@
+package main
+
+import (
+	"fmt"
+	"time"
+)
+
+func BubbleSort(arr *[]int) []int {
+	for i := 0; i < len(*arr)-1; i++ {
+		for j := 0; j < len(*arr)-1-i; j++ {
+			if (*arr)[j] > (*arr)[j+1] {
+				(*arr)[j], (*arr)[j+1] = (*arr)[j+1], (*arr)[j]
+			}
+		}
+	}
+	return *arr
+}
+
+func TestBubbleSort(arr []int) []int {
+	now := time.Now()
+	sortedArr := BubbleSort(&arr)
+	fmt.Printf("Optimized Time taken to Bubble sort an array of length %v : %v\n", len(arr), time.Since(now))
+	return sortedArr
+}