Data Structures

Collection of projects from my Data Structures course, focusing on implementing and analyzing key algorithms such as linked lists, Quicksort, Insertion Sort, and Selection Sort. Explored the practical aspects of time complexity and algorithm performance through coding and comparative analysis. Gained valuable hands-on experience in data structure design, dynamic memory management, and efficient problem-solving with C.

Assignments Overview

1. Assignment 1: Linked List Time Complexity Analysis

   • Topic: Linked Lists and Time Complexity
   • Description: This assignment analyzes the time complexity of finding the middle of a linked list. It explores various operations on linked lists and provides insights into the efficiency of linked list traversal and manipulation.

2. Assignment 2: Sorting Algorithm Comparison

   • Topic: Sorting Algorithms (Quicksort, Insertion Sort, and Selection Sort)
   • Description: This project implements and compares the performance of Quicksort, Insertion Sort, and Selection Sort algorithms. It provides a detailed comparison of the time complexity of these algorithms in the best, worst, and average cases, along with practical analysis of their performance.

Built With

This repository primarily utilizes:

• C: The core programming language used to implement the data structure algorithms.

How to Use

1. Clone the repository:

   git clone https://github.com/your-repo/data-structures.git

2. Navigate to the folder for the specific assignment.
3. Compile and run the C program using gcc:

   gcc Assignment1.c -o Assignment1
   ./Assignment1