Algorithms 1, Lent 2023

Algorithms 1, Lent 2023, Tick 1*: visualising bottom-up merge sort

Implement a visualisation of your bums.py in Python. Your program, bumsv.py, takes a sequence of at most 25 integers, one per line, from a file bumsv-input.txt, ignoring whitespace. It generates a Latex file anim.tex and compiles it to anim.pdf by invoking pdflatex, producing a pdf slide show. One may then view the animation of the sorting algorithm by moving forwards and backwards in the anim.pdf slide deck.

No extra course credit is awarded for the completion of the optional part.

What to do