The "algo" repository by Hoanhan101 is a collection of algorithms and data structures implemented in Go. It serves as a learning resource and reference for common computer science concepts, providing clear implementations and explanations for various algorithms and data structures.

Pros

• Comprehensive coverage of fundamental algorithms and data structures
• Clear, well-commented Go implementations
• Includes explanations and complexity analysis for each algorithm
• Organized structure with separate directories for different categories

Cons

• Limited to Go language implementations
• Some advanced algorithms or data structures may be missing
• Not actively maintained (last commit over 2 years ago)
• Lacks extensive documentation or tutorials for beginners

Code Examples

1. Binary Search implementation:

func BinarySearch(arr []int, target int) int {
    left, right := 0, len(arr)-1

    for left <= right {
        mid := left + (right-left)/2
        if arr[mid] == target {
            return mid
        } else if arr[mid] < target {
            left = mid + 1
        } else {
            right = mid - 1
        }
    }

    return -1
}

2. Quick Sort implementation:

func QuickSort(arr []int) []int {
    if len(arr) <= 1 {
        return arr
    }

    pivot := arr[len(arr)/2]
    left := make([]int, 0)
    right := make([]int, 0)
    equal := make([]int, 0)

    for _, num := range arr {
        if num < pivot {
            left = append(left, num)
        } else if num > pivot {
            right = append(right, num)
        } else {
            equal = append(equal, num)
        }
    }

    return append(append(QuickSort(left), equal...), QuickSort(right)...)
}

3. Linked List implementation:

type Node struct {
    Value int
    Next  *Node
}

type LinkedList struct {
    Head *Node
}

func (l *LinkedList) Append(value int) {
    newNode := &Node{Value: value}
    if l.Head == nil {
        l.Head = newNode
        return
    }

    current := l.Head
    for current.Next != nil {
        current = current.Next
    }
    current.Next = newNode
}

Getting Started

To use the algorithms and data structures in your Go project:

1. Clone the repository:

   git clone https://github.com/hoanhan101/algo.git
   

2. Import the desired package in your Go file:

   import "github.com/hoanhan101/algo/search"
   

3. Use the implemented functions:

   arr := []int{1, 3, 5, 7, 9}
   target := 5
   index := search.BinarySearch(arr, target)
   fmt.Printf("Found %d at index %d\n", target, index)