This repository contains all the programs I write for DSA studying purposes
The problems have been categorized based on the site I find them on. The link to the respective problems can be found in the first line of the code files. The solution has been written in a manner which renders it as self-explanatory as possible; comments too have been added for improving readability. For further explanation on any problem feel free to contact me at [email protected].
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Heap Sort
- Quick Sort
- Counting sort
- Radix sort
- BFS - Breadth First Search
- DFS - Depth First Search
- UFDS - Union Find Disjoint Sets
- AVL Tree - Self-Balancing BST, Insertion only
- Fenwick Tree
- Segment Tree
- Heap