Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).

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.

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.

Library for comparing and sorting strings lexicographically

First program accepts as an input a permutation and prints the permutation rank in the lexicpgraphic order of all same length permutations. Second program accepts two integers n and k as inputs and prints the permutation of [n] which is at position k in the lexicographic order of all its permutations of [n].

Course Project from CSC 445 - Operations Research: Linear Programming at UVic.