Daily Status

Notes for data structure and algos

Algorithms	Rev1	Rev2	Rev3	Rev4	Rev5
Insertion sort	✅	✅	✅	✅	✅
Heap sort	✅	✅	✅	✅	✅
Merge sort	✅	✅	✅	✅	✅
Quick sort	✅	✅	✅	✅	✅
Maximum subarray	✅	✅	✅	✅	✅
Strassen’s Algorithm for matrix multiplication	✅
Priority queues	✅
Counting sort	✅	✅	✅	✅	✅
Radix sort	✅	✅	✅	✅	✅
Stacks	✅	✅	✅	✅	✅
Queues	✅	✅	✅	✅	✅
Linked list	✅	✅	✅	✅	✅
Binary search trees	✅	✅	✅	✅	✅
Red black trees	✅
Interval trees	✅
Rod cutting	✅	✅	✅	✅	✅
Matrix chain multiplication	✅	✅	✅	✅	✅
Longest common subsequence	✅	✅	✅	✅	✅
Optimal binary search tree	✅	✅	✅	✅
Activity selection problem	✅	✅	✅
Huffman codes	✅	✅
B-trees	✅
Fibonacci heaps	✅
Van Emde Boas trees	✅
Linked list representation of disjoint sets	✅
Breadth first search	✅
Depth first search	✅
Topological sort	✅
Kruskal's algorithm	✅	✅
Prim's algorithm	✅
Bellman ford algorithm	✅
Single source shortest paths in directed acyclic graphs	✅
Dijkstra's algorithm	✅
Floyd Warshall Algorithm	✅
The ford fulkerson algorithm	✅
Maximum bipartite algorithm	✅
Push relable algorithm	✅
The relable to front algorithm
Multithreaded algorithm	✅
Multithreaded matrix multiplication	✅
Multithreaded merge sort	✅
Matrix operation	✅
Inverting matrices	✅
The simplex algorithm	✅
dft and fft	✅
Greatest common divisor	✅
The naive string matching algorithm	✅
The rabin karp algorithm	✅
String matching with finite automata	✅
knuth morris pratt algorithm	✅
Determining whether any pair of segment intersects	✅
Finding a convex hull	✅
Finding the closest pair of points	✅
The vertex cover problem	✅
travelling salesman problem	✅
set covering problem	✅
subset-sum problem	✅