Data-Structures-and-Algorithms

This contains all the implementations of data structures and algorithms for IIT kgp course of Data Structures and Algorithms

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
BST Insert.c		BST Insert.c
Bellman ford Algorithm.c		Bellman ford Algorithm.c
Bucketsort.c		Bucketsort.c
Counting sort.c		Counting sort.c
Dijitral Algorithm.c		Dijitral Algorithm.c
Double Hashing.c		Double Hashing.c
Dynamic order statistics.c		Dynamic order statistics.c
Heap sort.c		Heap sort.c
Insertion And Merge sort.c		Insertion And Merge sort.c
Interval trees.c		Interval trees.c
Kth smallest element.c		Kth smallest element.c
LCA-bst.c		LCA-bst.c
LCA.c		LCA.c
Linked Lists.c		Linked Lists.c
Neg_cycle Detection.c		Neg_cycle Detection.c
Open addressing.c		Open addressing.c
Pre-Post-Inorder Traversal.c		Pre-Post-Inorder Traversal.c
Prims Algorithm.c		Prims Algorithm.c
Quick Sort.c		Quick Sort.c
R-select Algorithm.c		R-select Algorithm.c
RB Dynamic Sort.c		RB Dynamic Sort.c
README.md		README.md
Radix sort.c		Radix sort.c
Red Black Tree Insert.c		Red Black Tree Insert.c
Reverse_string.c		Reverse_string.c
Selection Sort.c		Selection Sort.c
Universal Hashing.c		Universal Hashing.c
VEB.c		VEB.c
Van_Emde DataStructure.c		Van_Emde DataStructure.c
queue.c		queue.c
stacks.c		stacks.c

Provide feedback