📌 Data Structures Project

Explores fundamental data structures and algorithms, focusing on sorting, searching, BSTs, and hashing with computational efficiency analysis.

📜 About

The project involves:

• Sorting Algorithms: Bubble Sort, Insertion Sort, Selection Sort O(n²), Merge Sort, Quick Sort, Heap Sort O(n log n) and performance benchmarking on 100,000 elements.
• Searching Algorithms: Linear Search O(n), Binary Search O(log n), Interpolation Search O(log log n), Binary Interpolation Search
• Binary Search Tree Implementations:
  • By Student ID – Supports insertion, deletion, search, and modification
  • By Grades – Uses linked lists for duplicate grades.

📑 Report PDFs

• Report

💻 Technologies Used

• C