Go Algorithms and Data Structures

This repository contains a collection of classic algorithms and data structures implemented in Go.
For each algorithm, there is a dedicated Go file (e.g., bubble_sort.go) and a corresponding test file.

Table of Contents

• Sorting
• Searching
• Data Structures
• Graphs
• Trees
• String Algorithms
• Advanced Topics
• How to Run

---

Sorting

Status	Algorithm
[X]	Bubble Sort
[X]	Selection Sort
[X]	Insertion Sort
[X]	Merge Sort
[X]	Quick Sort
[X]	Heap Sort

---

Searching

Status	Algorithm
[X]	Linear Search
[X]	Binary Search
[X]	Interpolation Search
[X]	Jump Search
[X]	Exponential Search
[X]	Ternary Search

---

Data Structures

Status	Data Structure
[X]	Stack
[ ]	Queue
[X]	Linked List (Singly)
[X]	Linked List (Doubly)
[ ]	Hash Table
[ ]	Set (using Go’s map)

---

Graphs

Status	Algorithm / Topic
[ ]	Graph Representation
[ ]	Breadth-First Search
[ ]	Depth-First Search
[ ]	Dijkstra’s Algorithm
[ ]	Bellman–Ford Algorithm
[ ]	Minimum Spanning Tree

---

Trees

Status	Algorithm / Topic
[ ]	Binary Tree Traversals
[X]	Binary Search Tree (BST)
[ ]	AVL Tree
[ ]	Red-Black Tree
[ ]	Segment Tree
[ ]	Fenwick Tree (Binary Indexed)

---

String Algorithms

Status	Algorithm
[ ]	Naive String Search
[ ]	KMP (Knuth–Morris–Pratt)
[ ]	Rabin–Karp
[ ]	Boyer–Moore
[ ]	Longest Common Subsequence
[ ]	Longest Palindromic Substring

---

Advanced Topics

Status	Algorithm / Topic
[ ]	Backtracking
[ ]	Greedy Algorithms
[ ]	Dynamic Programming
[ ]	Matrix Exponentiation
[ ]	Convex Hull
[ ]	Concurrency in Go

---

How to Run

1. Clone or download this repository.
2. Make sure you have Go installed.
3. From the root directory, run:

   go test ./...