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 visually displays a graph of the timed results of your various prime algorithms (brute force + optimizations, sieve of eratosthenes) so that one can more clearly see the difference in performance each algorithm offers.
The graph you should produce can be a simple line graph, perhaps a unique color for each algorithm+optimization, with at least 8 different ranges that you run EACH combination through to obtain the time, and plot that result on your graph.
So: the vertical axis would be time, and the horizontal axis would be the upper bound (getting progressively larger the further you travel to the right).
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:
78:pnf3:final tally of results (78/78) *:pnf3:no errors, program runs without issue in TIC-80 [13/13] *:pnf3:user can specify lower and upper bounds at runtime [13/13] *:pnf3:specified algorithms are implemented and functional [26/26] *:pnf3:timing of process is implemented, functional, shown [13/13] *:pnf3:project page contributions as per project specifications [13/13]
Additionally: