• Overview
• Features
• License

This repository provides a comprehensive C++ library implementing various algorithms and data structures. It is designed with flexibility in mind and offers two versions:

• Default Branch: Traditional header-only implementation using .hpp files.

• Algorithms:
  • Bloom Filter
  • Ford Fulkerson
  • Graph Algorithms
  • Minimum Spanning Trees (Kruskal, Prim)
  • Sorting Algorithms: Bucket, Insertion, Merge, Quick, Two-Way Merge, Dual Pivot Quick, Hybrid Quick
  • Tree Algorithms
  • Union-Find
  • Select
  • Randomized Select
  • Select Variant
• Data Structures:
  • AVL Tree
  • Binary Search Tree (BST)
  • B-Tree
  • Doubly Linked List
  • Heap
  • Linked List
  • LRU Cache
  • Queue
  • Red-Black Tree
  • Stack
  • Trie
  • Binomial Heap
  • RBBST
  • Splay

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