Christopher Poenaru kiambogo

## merge_sort.go
package main

import (
	"log"
)

func main() {
	array := []int{}
	assert([]int{}, mergeSort(array))

## binary_search.go
package main

import (
	"log"
)

func main() {
	assert(false, binarySearch([]int{}, 5))
	assert(false, binarySearch([]int{4}, 5))
	assert(true, binarySearch([]int{5}, 5))

## selection_sort.go
package main

import (
	"log"
	"math"
)

func main() {
	array := []int{}
	selectionSort(&array)

## bubble_sort.go
package main

import (
	"log"
)

func main() {
	array := []int{}
	bubbleSort(&array)
	assert([]int{}, array)

## fib.go
package main

import "log"

func main() {
	assert(0, fib(0))
	assert(1, fib(1))
	assert(1, fib(2))
	assert(2, fib(3))
	assert(3, fib(4))

## dfs.go
package main

import "log"

type Node struct {
	val      int
	marked   bool
	children []*Node
}

## bfs.go
package main

import "log"

type Node struct {
	val      int
	marked   bool
	children []*Node
}

## min_heap.go
package main

import "log"

type MinHeap struct {
	arr  []int
	size int
}

func (mh *MinHeap) Insert(d int) {

## singly_linked_list.go
package main

import "log"

type Node struct {
	val  int
	next *Node
}

type SinglyLinkedList struct {

## queue.go
package main

import "log"

type Node struct {
	val  int
	next *Node
}

type Queue struct {
	package main

	import (
	"log"
	)

	func main() {
	array := []int{}
	assert([]int{}, mergeSort(array))
	package main

	import "log"

	func main() {
	assert(0, fib(0))
	assert(1, fib(1))
	assert(1, fib(2))
	assert(2, fib(3))
	assert(3, fib(4))
	package main

	import "log"

	type Node struct {
	val int
	marked bool
	children []*Node
	}
	package main

	import "log"

	type MinHeap struct {
	arr []int
	size int
	}

	func (mh *MinHeap) Insert(d int) {