This repo is created as a part of Data Structure and Algorithms course at my college and contains implementations of some data structures and algorithms from scratch.
| Lab | Algorithms/Model |
|---|---|
| Lab 1 | Stack, Queue, Doubly Linked List |
| Lab 2 | Binary Search Trees |
| Lab 3 | Priority Queue and Heapsort using max-heaps |
| Lab 4 | Merge Sort and Quick Sort |
| Lab 5 | Radix Sort |
| Lab 6 | Breadth First Search (BFS) and Depth First Search (DFS) |
| Lab 7 | Kruskal’s algorithm to find a minimum spanning tree (MST) |
| Lab 8 | Dijkstra’s algorithm for finding Shortest Path Distance |
| Lab 9 | Finding anagrams using hashing |
| Lab 10 | Extended Euclidean algorithm for finding GCD of two numbers |