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