Core Data Structures & Algorithms in C

A professional repository containing fundamental data structures and algorithmic implementations in C. This project focuses on efficient memory management, modular code design, and low-level system understanding.

---

🛠 Technical Overview

This collection is structured to provide clear, documented implementations of essential computer science concepts:

Linear Data Structures

• Arrays: Dynamic resizing and common manipulation algorithms.
• Linked Lists: Singly, Doubly, and Circular implementations.
• Stacks & Queues: Array-based and Linked List-based (LIFO/FIFO) structures.

Non-Linear Data Structures

• Trees: Binary Trees, Binary Search Trees (BST), and various traversal methods (In-order, Pre-order, Post-order).
• Graphs: Basic adjacency list and matrix representations.

Algorithms & Logic

• Sorting: Optimized implementations of Bubble, Selection, Insertion, Merge, and Quick Sort.
• Searching: Linear and Binary search methodologies.
• Memory Management: Demonstrations of malloc, calloc, realloc, and free to ensure zero memory leaks.

---

🚀 Getting Started

Prerequisites

• Compiler: GCC (recommended) or any C99/C11 compliant compiler.
• Build Tools: make (optional, for automated builds).

Installation & Execution

1. Clone the repository:

   git clone [https://github.com/Hemanth18-2004/Core-Data-Structures-C.git](https://github.com/Hemanth18-2004/Core-Data-Structures-C.git)
   cd Core-Data-Structures-C

2. Navigate into the folder:

   cd Core-Data-Structures-C

3. Compile a program:

   gcc filename.c -o output

4. Run the program:

   ./output

Purpose

• Understand Data Structures and Algorithms
• Improve C programming skills
• Practice for coding interviews and exams

Contributing

Contributions are welcome. Fork the repository and submit a pull request.

Author

Hemanth18-2004

Support

If you found this useful, give it a star.