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

Diameter of a tree using breadth first search

Comparing the performance of sorting algorithms for large input

Topological order using depth first search

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

Binary search tree implementation

Binary heap implementation

Doubly linked list implementation

Bounded queue implementation

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

Implementation of Double hashing and robin hood hashing

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

Implementation of arithmetic with large integers, of arbitrary size.