GitHub - iCodeIN/Implementations_of_various_algorithms_and_data_structures: A few common data structures and algorithms implemented in C++.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 21 Commits
dp		dp
hash_table		hash_table
BST.cpp		BST.cpp
KMP.cpp		KMP.cpp
Karger_min_cut.cpp		Karger_min_cut.cpp
Z-algo.cpp		Z-algo.cpp
bfs.cpp		bfs.cpp
closest_pair.cpp		closest_pair.cpp
convex_hull_naive.cpp		convex_hull_naive.cpp
dfs.cpp		dfs.cpp
extended_Euclidean_Inverse.cpp		extended_Euclidean_Inverse.cpp
fast_exponentiation.cpp		fast_exponentiation.cpp
fast_inverse.cpp		fast_inverse.cpp
fibonacci.cpp		fibonacci.cpp
heap.cpp		heap.cpp
karatsuba_integer_multiplication_algorithm.cpp		karatsuba_integer_multiplication_algorithm.cpp
kargerMinCut.txt		kargerMinCut.txt
matrix.cpp		matrix.cpp
matrix.h		matrix.h
mergesort.cpp		mergesort.cpp
prim_Minimial_spanning_tree.cpp		prim_Minimial_spanning_tree.cpp
primes_sieve_of_Eratosthenes.cpp		primes_sieve_of_Eratosthenes.cpp
quicksort_randomized.cpp		quicksort_randomized.cpp
rabin_miller_primality_deterministic.cpp		rabin_miller_primality_deterministic.cpp
readme.txt		readme.txt
segment_tree.cpp		segment_tree.cpp
sqrt_decomp.cpp		sqrt_decomp.cpp
suffix_array.cpp		suffix_array.cpp
union_find_rank_path_compression.cpp		union_find_rank_path_compression.cpp
vector.cpp		vector.cpp

Repository files navigation

This contains the implementations of various algorithms and data structures taught in the course by Stanford university, on coursera.
This contains the following algorithms / data structures:
1. Karatsuba integer multiplication algorithm.
2. Mergesort with counting inversions.
3. Closest pair of points on a plane
*. Strassen's Matrix multiplication algorithm.
4. Quicksort and ith order statistic.
5. Karger's minimum cut algorithm with union-find data structure.
6. BFS and DFS
7. Fibonacci Nth term with/without matrix exp.
8. Segment tree
9. Heap
10. Convex Hull, naive implementation
11. Fast Modular exponentiation
12. Sieve of Eratosthenes for generating primes (now linear time).
13. N-dimensional Vectors
13. Prim's Minimal spanning tree algorithm
14. Algorithm to find Suffix array of a string
15. hash table using open addressing
16. Rabin Miller deterministic primality test
17. fast modular multiplicative inverse
18. Matrix library
19. Extended Euclidean algorithm to find modular multiplicative inverse
20. Knuth Morris Pratt string matching algorithm
21. Z algorithm for string matching
22. Square-root decompositon for range sum queries.
23. Binary search tree (with insert, delete, search, print)
24. Union Find (Disjoint Set Union) with union by rank and path compression.

* : Yet to be added.