Big O Adventure

A game made for my honour's project at the University of Glasgow. The game aims to teach players about the complexity of algorithms and big O notation through a series of mini-games. ​

Some of the mini-games are gamified versions of well known sorting algorithms, such as merge-sort and bubble-sort. These games task the player at sorting a list in the same way the algorithm would. 

​

Also featured are visualisations of the algorithm sorting the lists, and graphs of the operation count of each algorithm as the problem size increases.

​

The other mini-games are well known puzzles such as the travelling salesman problem or NQueens. These problems also provide visualisations to show the player how they function.