Algorithms Repository

This repository contains implementations and assignments related to Design and Analysis of Algorithms. Each file represents a specific algorithm or assignment problem solved using Python.

---

Repository Contents

File	Description
BST.ipynb	Implementation of Binary Search Tree (BST) with functions to calculate equity of non-leaf nodes and find nodes with maximum equity.
Graph.py	Implementation of graph algorithms (e.g., BFS, DFS, shortest paths, or other graph-related problems).
HashSet.py	Custom implementation of a HashSet in Python, demonstrating basic hashing and collision handling.
HeapSort.ipynb	Implementation of Heap Sort algorithm for sorting arrays.
Insertion Sort.py	Classic Insertion Sort implementation for educational purposes.
KNN.ipynb	Implementation of K-Nearest Neighbors (KNN) algorithm from scratch, supporting multiple distance metrics and testing on datasets.
Optimized QuickSort.py	Implementation of QuickSort with median-of-three pivot selection and recursive optimization.
data-assgn-5.txt	Input data for BST and equity calculation assignment.
data-assgn-6.txt	Input data for graph-related assignment.
data-assgn-7.txt	Input data for KNN assignment.
data-assgn3.txt	Input data for sorting and partitioning assignments.
data-assgn4.txt	Input data for additional sorting and algorithm practice.

---

⚙️ How to Run the Code

1. Clone the repository:

git clone https://github.com/CodexQuasar/Algorithms.git
cd Algorithms