Implementation Status

This page tracks the implementation progress of all algorithms and data structures in OpenDSA. Want to contribute? Pick any item marked with ○ and start building!

Progress Overview

Total Items: 70+
Implemented: 4
In Progress: Community-driven development

Data Structures

Arrays

Topic	Status
Basic Array Operations	✅ Implemented
Dynamic Arrays	○ Pending
Multi-dimensional Arrays	○ Pending

Linked Lists

Topic	Status
Singly Linked List	○ Pending
Doubly Linked List	○ Pending
Circular Linked List	○ Pending

Stacks

Topic	Status
Basic Stack Operations	○ Pending
Applications (Balancing Parentheses)	○ Pending

Queues

Topic	Status
Basic Queue	○ Pending
Circular Queue	○ Pending
Priority Queue	○ Pending
Deque (Double-Ended Queue)	○ Pending

Trees

Topic	Status
Binary Tree	○ Pending
Binary Search Tree (BST)	○ Pending
AVL Tree (Self-Balancing BST)	○ Pending
Red-Black Tree	○ Pending
Segment Tree	○ Pending
Trie	○ Pending
B-Tree and B+ Tree	○ Pending

Heaps

Topic	Status
Min Heap	○ Pending
Max Heap	○ Pending
Fibonacci Heap	○ Pending

Graphs

Topic	Status
Directed/Undirected Graphs	○ Pending
Weighted/Unweighted Graphs	○ Pending
Adjacency Matrix	○ Pending
Adjacency List	○ Pending
Edge List	○ Pending

Hashing

Topic	Status
Hash Tables	○ Pending
Hash Maps	○ Pending
Open Addressing	○ Pending
Separate Chaining	○ Pending

Algorithms

Sorting (Easy)

Topic	Status
Bubble Sort	✅ Implemented
Selection Sort	○ Pending
Insertion Sort	○ Pending

Sorting (Intermediate)

Topic	Status
Merge Sort	○ Pending
Quick Sort	○ Pending

Sorting (Advanced)

Topic	Status
Heap Sort	○ Pending
Counting Sort	○ Pending
Radix Sort	○ Pending
Bucket Sort	○ Pending

Searching

Topic	Status
Linear Search	✅ Implemented
Binary Search	○ Pending
Jump Search	○ Pending
Exponential Search	○ Pending

Graph Algorithms

Topic	Status
Breadth-First Search (BFS)	○ Pending
Depth-First Search (DFS)	○ Pending
Dijkstra’s Algorithm	○ Pending
Floyd-Warshall	○ Pending
Bellman-Ford	○ Pending
Prim’s MST	○ Pending
Kruskal’s MST	○ Pending
A* Search	○ Pending

Dynamic Programming

Topic	Status
Fibonacci	○ Pending
Coin Change (Minimum Coins)	○ Pending
Longest Common Subsequence (LCS)	○ Pending
Knapsack Problem	○ Pending
Matrix Chain Multiplication	○ Pending

Backtracking

Topic	Status
Rat in a Maze	○ Pending
N-Queens Problem	○ Pending
Knight’s Tour	○ Pending
Sudoku Solver	○ Pending

Greedy Algorithms

Topic	Status
Activity Selection	○ Pending
Fractional Knapsack	○ Pending
Huffman Coding	○ Pending
Job Sequencing	○ Pending

Miscellaneous Algorithms

Topic	Status
Sieve of Eratosthenes (Prime Numbers)	○ Pending
Euclidean Algorithm (GCD)	○ Pending
KMP Pattern Matching	○ Pending
Rabin-Karp Algorithm	○ Pending
Bit Manipulation	○ Pending
Randomized Algorithms (QuickSelect)	○ Pending

Future Plans

Machine Learning Visualizers (Coming Soon)

Linear Regression
Logistic Regression
Decision Trees
K-Means Clustering
Neural Network Forward/Backward Pass
Gradient Descent

Deep Learning Visualizers (Coming Soon)

Convolutional Neural Networks (CNN)
Recurrent Neural Networks (RNN)
Transformer Architecture
Attention Mechanisms

How to Contribute

Pick an item - Choose any pending (○) algorithm or data structure
Create an issue - Let the community know you’re working on it
Build the visualizer - Follow our architecture guide
Submit a PR - Reference the issue in your pull request

See our Contributing Guide for detailed instructions.