opus-tango/DSA-reference
1
0
Fork 0
mirror of https://github.com/opus-tango/DSA-reference.git synced 2026-03-20 03:55:22 +00:00
Code Issues Packages Projects Releases Wiki Activity

test link and rendering

Browse Source
This commit is contained in:
Nayan Sawyer
2025-11-13 20:45:06 -05:00
parent 88e8cfff5e
commit 38854e9b53
1 changed files with 60 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

120
readme.md
View File

@@ -32,69 +32,69 @@ The project will include examples in the following languages:
The project will include examples of the following data structures:
- Arrays
- Static Array
- Dynamic Array
- Linked List
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Stack (LIFO)
- Queue (FIFO) and Deque (Doubly Ended Queue)
- Hash Table
- KV Hash Table
- Collision Detection
- Trees
- Binary Tree
- Binary Search Tree
- AVL Tree (Self-Balancing)
- Red-Black Tree (Self-Balancing)
- B-Tree (Self-Balancing)
- Trie (Prefix Tree)
- Tree algorithms
- Graphs
- Adjacency List
- Adjacency Matrix
- Directed Graphs
- Weighted Graphs
- Adjacency List/Matrix
- Disjoint Set (Union-Find)
- [ ] Arrays
- [ ] Static Array
- [ ] Dynamic Array
- [ ] Linked List
- [ ] Singly Linked List
- [ ] Doubly Linked List
- [ ] Circular Linked List
- [ ] Stack (LIFO)
- [ ] Queue (FIFO) and Deque (Doubly Ended Queue)
- [ ] Hash Table
- [ ] KV Hash Table
- [ ] Collision Detection
- [ ] Trees
- [ ] Binary Tree
- [ ] Binary Search Tree
- [ ] AVL Tree (Self-Balancing)
- [ ] Red-Black Tree (Self-Balancing)
- [ ] B-Tree (Self-Balancing)
- [ ] Trie (Prefix Tree)
- [ ] Tree algorithms
- [ ] Graphs
- [ ] Adjacency List
- [ ] Adjacency Matrix
- [ ] Directed Graphs
- [ ] Weighted Graphs
- [ ] Adjacency List/Matrix
- [ ] Disjoint Set (Union-Find)
## Algorithms
- Sorting
- Bubble Sort (Maybe)
- Selection Sort (Maybe)
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Searching Algorithms
- Linear Search
- Binary Search
- Graph Traversal
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Minimum Spanning Tree (MST)
- Recursion and Backtracking
- Dynamic Programming
- Memoization
- Tabulation
- Greedy Algorithms
- Fractional Knapsack Problem
- Activity Selection Problem
- Huffman Coding
- Sieve of Eratosthenes (Prime Number Generation)
- Euclidean Algorithm (Greatest Common Divisor)
- String Algorithms
- KMP Algorithm
- Rabin-Karp Algorithm
- Bit Manipulation
- [ ] Sorting
- [ ] Bubble Sort (Maybe)
- [ ] Selection Sort (Maybe)
- [ ] Insertion Sort
- [ ] Merge Sort
- [ ] Quick Sort
- [ ] Heap Sort
- [ ] Searching Algorithms
- [ ] Linear Search
- [ ] Binary Search
- [ ] Graph Traversal
- [ ] Depth-First Search (DFS)
- [ ] Breadth-First Search (BFS)
- [ ] Dijkstra's Algorithm
- [ ] Bellman-Ford Algorithm
- [ ] Floyd-Warshall Algorithm
- [ ] Kruskal's Algorithm
- [ ] Prim's Algorithm
- [ ] Minimum Spanning Tree (MST)
- [ ] Recursion and Backtracking
- [ ] Dynamic Programming
- [ ] Memoization
- [ ] Tabulation
- [ ] Greedy Algorithms
- [ ] Fractional Knapsack Problem
- [ ] Activity Selection Problem
- [ ] Huffman Coding
- [ ] Sieve of Eratosthenes (Prime Number Generation)
- [ ] Euclidean Algorithm (Greatest Common Divisor)
- [ ] String Algorithms
- [ ] KMP Algorithm
- [ ] Rabin-Karp Algorithm
- [ ] Bit Manipulation
## License