Degree-Constrained Minimum Spanning Tree using Prim’s Algorithm [code]. Seven different sort algorithms compared in milliseconds [code]. Merge and quick partition sort algorithms compared in nanoseconds [code]. Implementation of Knapsack sorting with time comparing in nanoseconds [code]. Implementation of Dijkstra’s Algorithm [code]. Implementation of Hadamard’s Algorithm [code]. The last figure is a game using algorithm to find the largest square of one’s in a matrix with GUI [code].