Implementation of various algorithms

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.

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.

HackerRank Counting Inversions using binary indexed trees

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

counting inversions using divide-and-conquer algorithm

A game where a group of players are presented, one by one, with a list of scrambled numbers and must then sort it as efficiently as possible, counting time, and of course, the number of inversions needed to get there, as their points are calculated this way. Several rounds of varying difficulty can be used.

Um jogo onde um grupo de players são apresentados, um por um, a uma lista de números embaralhadas e devem então classificá-la da forma mais eficiente possível, contando tempo, e é claro, número de inversões necessárias para chegar lá, pois seus pontos são calculados assim. Podem ser usados vários rodadas com dificuldades diferentes.