knuths-algorithm-l
There are 2 repositories under knuths-algorithm-l topic.
rahul1947/SP11-K-Largest-Elements-and-Enumeration
Implementation of O(n) Select Algorithm to find K largest elements and compare it's performance with an Algorithm to find K largest elements using Priority Queue. Implementation of Enumeration algorithms - permutations(), combinations(), heap(), and Knuth's Algorithm L.
rahul1947/SP12-Breadth-First-Search-and-Enumeration
Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.