This is an old revision of the document!
Corning Community College
CSCS2330 Discrete Structures
Using the TIC-80 fantasy console simulator on your pi, implement a program that performs a sorting of a randomized list of values, both displaying an animation of the sort, along with timing and keeping track of the approximate number of steps needed to accomplish the task for variable numbers of non-animated runtimes.
The sorting algorithm I'd like for you to produce is that of a naive approach:
In future projects we will be looking at the specifics of established, existing sorting algorithms. Part of the task here is to establish a baseline: you exploring some process without existing knowledge or experience in sorting, so that you can become more familiar with some of the underlying details of what it means to sort values (so our later explorations make more sense).
Additionally, the entire class will be participating in documenting and filling out this project page. It is the responsibility of EACH class member to:
I'll be looking for the following:
52:saf0:final tally of results (52/52) *:saf0:no errors, program runs without issue in TIC-80 [13/13] *:saf0:specified algorithm is implemented and functional [13/13] *:saf0:metrics, timing of process is implemented, functional, shown [13/13] *:saf0:project page contributions as per project specifications [13/13]
Additionally: