Algorithm

This directory contains notes and implementations of various algorithms in Go.

Contents

1. Binary_Search.md

   • Implementation and examples

   • Time and space complexity

   • Real-world applications

   • Resources and practice problems

2. Big_O_Notation.md

   • Common time complexities with examples

   • Space complexity analysis

   • Performance comparison

   • Implementation examples

3. Recap.md

   • Summary of concepts

   • Best practices

   • Code organization

   • Additional resources

Categories

• Sorting Algorithms

  • Bubble Sort

  • Merge Sort

  • Quick Sort

• Searching Algorithms

  • Binary Search

  • Linear Search

• Graph Algorithms

  • DFS

  • BFS

  • Dijkstra

• Dynamic Programming

  • Fibonacci

  • Knapsack

  • LCS

• Greedy Algorithms

  • Fractional Knapsack

  • Job Scheduling

• Divide and Conquer

  • Binary Search

  • Merge Sort

  • Quick Sort

Resources

Books

1. Algorithm Fundamentals:

   • "Introduction to Algorithms" by CLRS

   • "Algorithms" by Robert Sedgewick

   • "The Art of Computer Programming" by Donald Knuth

2. Go-Specific:

   • "Go Programming Language" by Alan A. A. Donovan

   • "Data Structures & Algorithms in Go" by Hemant Jain

Online Courses

1. Algorithm Courses:

   • MIT OpenCourseWare

   • Coursera - Algorithms Specialization

   • Stanford Algorithms

2. Go Programming:

   • Go Tour

   • Go by Example

   • Exercism - Go Track

Useful Links

1. Practice Platforms:

   • LeetCode

   • HackerRank

   • Project Euler

2. Documentation:

   • Go Documentation

   • Go Package Documentation

   • Effective Go