Use this script: pi.py
A+ presents the exercise submission form here.
Use these scripts: test_fizzbuzz.py and
Use this script: sorting.py.
In script sorting.py you can find an implementation of the insertion sort algorithm,
and two different implementations of the quicksort algoritm.
Our goal in this exercise is to profile this script to get an idea of the running time and computational complexity of the algorithms.
The sorting.py is run as follows.
Running the script should take less than 20 seconds.
Now sorting using quicksort_lumoto
Now sorting using quicksort
Now sorting using insertion_sort
Profile the three sorting algorithms and answer the following questions.
There are numerous ways to answer such questions, but we encourage the use of Python profiler cProfile.
You can import the cProfile module and take advantage of its run function.
Please refer to Hands-on Scientfic Computing for a tutorial
and/or read through Python’s documentation of profilers for more information.
Use these scripts: graph.edges, graph.py,
main.py and test_graph.py.
Choose whether a claim is true or false.
Below you can see different scenarios where you should figure out an area of reproducible research that would help.
Was this module useful for you?