This program is a rewrite of the example problem in the following youtube video: https://youtu.be/Q_1M2JaijjQ

The Problem: For nonnegative integers n, a, b, c find all sets (a, b, c) where n = a + b + c

The Solutions: Alice and Bob

This program demonstrates the difference in efficiency of Alice and Bob's algorithms by calculating machine dependent runtime and machine independent number of iterations.

The user can input an integer for n and print the results of the algorithms.

OUTSIDE RESOURCES:

www.w3schools.com/python/ref_list_clear.asp [].clear() method this is preferable to assigning a new empty list to keep memory usage down

https://docs.python.org/3/library/time.html time.perf_counter() used to calculate amount of time spent processing

https://medium.com/@johnidouglasmarangon/padding-f-strings-in-python-977b17edbd36 f"{:^10} center padding format

https://stackoverflow.com/questions/44206813/how-to-convert-function-to-str-for-python use inspect to convert function to a string