main.go

package main

import (
	"fmt"
	"strconv"

	"github.com/whalelogic/Go-Programming/ll"
	"github.com/whalelogic/Go-Programming/sort"
	"github.com/whalelogic/Go-Programming/stack"
	"github.com/whalelogic/Go-Programming/recursion"
)


func fib(n int) int {
	if n <= 1 {
		return n
	}
	return fib(n-1) + fib(n-2)
}



var myList ll.List[int]

func main() {
	// Stack example
	arr2 := []int{3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5}
	sortedArr := sort.Sort(arr2)
	fmt.Println(sortedArr)
	arr := stack.Stack{}
	arr.Push(10)
	arr.Print()

	// Linked List example
	myList.PushBack(10)
	myList.PushBack(20)
	myList.PushFront(5)
	myList.InsertAfter(myList.Front(), 7)
	myList.InsertAfter(myList.Front(), 13)

	fmt.Println("Linked List elements:")
	// loop through the list and print elements
	for e := myList.Front(); e != nil; e = e.Next() {
		fmt.Println(e.Value)
	}

	fmt.Println("First element: ", myList.Front().Value)
	fmt.Println("Last element: ", myList.Back().Value)
	fmt.Println("Length of linked-list: ", myList.Length())
	sl := myList.MakeSlice()
	for i := range sl {
		// Must convert int to string to concatenate
		fmt.Println(strconv.Itoa(i) + ": " + strconv.Itoa(sl[i]))
	}
	
	v, ok := myList.RemoveFront()
	if ok {
		fmt.Println("Removed front element: ", v)
	}

	fact := recursion.Factor(5)
	var t []string
	t = append(t, "Factorial of 5 is: "+strconv.Itoa(fact))

	print(t)

	fmt.Println("Fibonacci of 7 is: ", fib(7))


	


}