Implementation of various algorithms

counting inversions using divide-and-conquer algorithm

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

Calculating Counting Inversion by using Merge Sort (A Divide and Conquer Approach)

HackerRank Counting Inversions using binary indexed trees

Thesis Project - The goal of this project was to create an algorithm visualization (AV) tool for students and faculty of CSUN to use, rather than using a whiteboard to draw complex graphs and diagrams. The algorithms I covered are Counting Inversions, Kruskal's Minimum/Maximum Spanning Tree, and Steiner Tree.