xBlaz3kx/dsa

Implementation of data structures and algorithms in Go.

Data structures and algorithms (implemented in Go)

In this repository, I will be implementing various data structures and algorithms using Go. This is a work in progress and I will be adding more implementations as I learn them.

All the implementations are tested using unit tests. You can find the tests in the *_test.go files.

Data Structures

• Linked List (with thread-safe version)
  • Singly Linked List
• Stack (with thread-safe version)
• Queue (with thread-safe version)
• Binary Search Tree (with traversal and search)
• TODO Heap
• Graph (with BFS, DFS, topological sort, using both adjacency list and matrix techniques)

Algorithms

• Sorting
  • Bubble Sort
  • TODO Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
• Searching
  • Linear Search
  • Binary Search
• TODO Sliding Window
• Rate Limiting
  • Leaky Bucket
  • Token Bucket

Running unit tests

You can run the tests using the go test -v ./... command.

$ go test -v ./...

License

This project is licensed under the MIT License - see the LICENSE file for details.