This repository contains my implementations of fundamental Data Structures and Algorithms (DSA) in the C programming language.
I created these programs while learning DSA to improve my programming skills, strengthen my understanding of core concepts, and build a strong foundation for coding interviews and placements.
- 1D Array
- 2D Array
- 2D Array using Pointers
- Array using Pointers
- Array Traversal
- Array Insertion
- Insert at Beginning
- Array Deletion
- Linear Search
- Binary Search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Singly Linked List
- Circular Linked List
- Doubly Linked List
- Stack using Array
- Stack using Linked List
- Queue using Array
- Queue using Linked List
- Queue using Stack
- Circular Queue using Array
- Circular Queue using Linked List
- Deque using Circular Array
- Binary Tree
- Binary Search Tree (BST)
- Full BST
- Heapify
- Maximum & Minimum in BST
- Pointer Basics
- Arrays and Pointers
- Beginner-friendly C programs
- Covers essential Data Structures
- Includes popular Searching and Sorting algorithms
- Easy to understand and practice
- Written for learning purposes
- C Programming Language
- GCC Compiler
- Visual Studio Code
Compile any C program using GCC.
gcc filename.c -o outputRun the program:
./outputExample:
gcc binary_search.c -o binary_search
./binary_searchThe purpose of this repository is to learn and practice Data Structures and Algorithms by implementing them from scratch in C without using external libraries.
- Add Time and Space Complexity for each program
- Add Graph Data Structure
- Add AVL Tree
- Add Trie
- Add Sample Inputs and Outputs
- Improve code organization
Trayam Roy
B.Tech Information Technology
GitHub: https://github.com/heyytrayamm
06:14 AM,Midnapore,WB