Algorithm Library

Here's a list of highly efficient frequently needed algorithms implemented by me. If you want implementations of any, just write to me.

1. Tree Traversals
   1. Get post-order traversal given pre-order and in-order traversals uniquely determining a binary tree.
   2. Get pre-order traversal given post-order and in-order traversals uniquely determining a binary tree.
   3. Get in-order traversal given pre-order and post-order traversals uniquely determining a binary tree having exactly two children for every internal node.
2. Matrix Algorithms
   1. Inverting Matrices
   2. Strassen's Algorithm for matrix multiplication
3. Graph Algorithms
   1. BFS, DFS, topological Sorting, Strongly Connected Components etc.
   2. Bellman Ford and Dijkstra's algorithm (using minimum heap and priority queue) for single source shortest paths
   3. Floyd-Warshall's Algorithm for all-source shortest paths
   4. Prim's and Kruskal Algorithm for generation of minimum spanning tree
   5. Dynamic Programming in tree to reduce many O(n²) algorithms to O(n)
   6. Diameter of a tree using Breadth First Search
4. Dynamic Programming
   1. Knapsack (0,1) Problem
   2. Longest Common Sub-sequences
   3. Assembly Line Chaining
   4. Polynomial-time Matrix Multiplication
   5. Dynamic Programming to reduce many exponential-time algorithms to polynomial-time
5. Elementary Sorting Algorithms
   1. Tree Sort
   2. Heapsort
   3. Merge Sort
   4. Quicksort
   5. Sorting in Linear time: Counting Sort, Radix sort and Bucket Sort
6. Miscellaneous
   1. Generating contiguous prime numbers between two given numbers anywhere within range of 1 to 10^9 and differing by at most 10^5 in under 0.21 s (in a heavy language like Java) by optimising Sieve of Eratosthenes
   2. Finding the next palindrome of an input number which can contain as many as 10^9 digits (yes DIGITS)!
   3. Variable Converter: A DFA that can convert c_cplusplus_type_variables to javaTypeVariables and vice-versa.
   4. Conference Track Management program - using a best-fit approximation algorithm on talks sorted in descending order by duration.
   5. Problems on probability, combinatorics ... etc.