Data Structures using C

1) Implementation of selection sort and bubble sort along with time and space complexity evaluation

2) Implementation of linear search and binary search along with time and space complexity evaluation

3) Implementation of sparse matrices using arrays

4) Representation of polynomial using arrays

5) Implementation of stack, queue using arrays

6) Implementation of Circular Queue using arrays

7) Conversion of expression from one notation to another

8) Implementation of Linked List operations

9) Polynomial addition using linked list

10) Implementation of binary trees using arrays

11) Implementation of insertion and quick sort

12) Implementation of merge and heap sort

13) Implementation of DFS and BFS for graph

14) Implementation of hash table with overflow handling technique

15) Simulation of a basic memory allocation and garbage collector