luke-else/AdventOfCode2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

New Shared Library

Browse Source
This commit is contained in:
Luke Else
2021-12-16 21:11:39 +00:00
parent 1a2247044a
commit 6111f86a04
24 changed files with 559 additions and 392 deletions
Download Patch File Download Diff File Expand all files Collapse all files

43
day07/7a/main.go
View File

@ -1,6 +1,7 @@
package main
import (
"AdventOfCode2021/shared"
"bufio"
"fmt"
"math"
@ -13,7 +14,7 @@ func main() {
content := returnContent("../input")
//content := returnContent("../testInput")
list := mergeSort((*content), 0, len(*content)-1)
list := shared.MergeSort((*content), 0, len(*content)-1)
position := list[len(list)/2]
var cost float64
@ -48,43 +49,3 @@ func returnContent(path string) *[]int {
return &content
}
//sorting algorithm
func mergeSort(nums []int, start int, end int) []int {
if start == end {
return []int{nums[start]}
}
var mid int = ((end - start) / 2) + start
//Assign values back into Left and right
left := mergeSort(nums, start, mid)
right := mergeSort(nums, mid+1, end)
var combined []int
//Pointers for new array
leftPointer, rightPointer := 0, 0
for leftPointer <= len(left)-1 || rightPointer <= len(right)-1 {
if leftPointer == len(left) {
addValue(&combined, right[rightPointer], &rightPointer)
} else if rightPointer == len(right) {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
if left[leftPointer] <= right[rightPointer] {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
addValue(&combined, right[rightPointer], &rightPointer)
}
}
}
return combined
}
func addValue(nums *[]int, value int, pointer *int) {
*nums = append(*nums, value)
*pointer++
}

43
day07/7b/main.go
View File

@ -1,6 +1,7 @@
package main
import (
"AdventOfCode2021/shared"
"bufio"
"fmt"
"math"
@ -13,7 +14,7 @@ func main() {
content := returnContent("../input")
//content := returnContent("../testInput")
crabs := mergeSort(*content, 0, len(*content)-1)
crabs := shared.MergeSort(*content, 0, len(*content)-1)
min, max := crabs[0], crabs[len(crabs)-1]
@ -76,43 +77,3 @@ func returnContent(path string) *[]int {
return &content
}
//sorting algorithm
func mergeSort(nums []int, start int, end int) []int {
if start == end {
return []int{nums[start]}
}
var mid int = ((end - start) / 2) + start
//Assign values back into Left and right
left := mergeSort(nums, start, mid)
right := mergeSort(nums, mid+1, end)
var combined []int
//Pointers for new array
leftPointer, rightPointer := 0, 0
for leftPointer <= len(left)-1 || rightPointer <= len(right)-1 {
if leftPointer == len(left) {
addValue(&combined, right[rightPointer], &rightPointer)
} else if rightPointer == len(right) {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
if left[leftPointer] <= right[rightPointer] {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
addValue(&combined, right[rightPointer], &rightPointer)
}
}
}
return combined
}
func addValue(nums *[]int, value int, pointer *int) {
*nums = append(*nums, value)
*pointer++
}