Implementation of arithmetic with large integers, of arbitrary size.

Enumeration of all topological orders of a DAG and Program evaluation and review technique

Implementation of Prim and Kruskal's Minimum spanning tree algorithms using indexed heaps

Doubly linked list implementation

Bounded queue implementation

Binary heap implementation

Binary search tree implementation

Implementation of Double hashing and robin hood hashing

Topological order using depth first search

Comparing the performance of sorting algorithms for large input

Implementation of the algorithm to find strongly connected components of a directed graph

Comparison of two algorithms to find k-largest elements in an array

Diameter of a tree using breadth first search