COP 4533 St Petersburg College Python Algorithm Worksheet

Chapters 1-8, which is available online and include interactive programing and lectures

http://interactivepython.org/runestone/static/pyth…

1. Choose two different algorithms to find the shortest path. Using thosealgorithms, implement “program_a.py” which uses the first to find theshortest path between nodes A and I for the graph below. Implement“program_b.py” which uses the second to find the shortest path betweennodes A and I for the graph below. Use timeit to measure the performance onboth.Write a discussion that compares results in program_a.py and program_b.py. Inyour discussion, include analysis of the time complexity, i.e Big O.2. Create a Microsoft word document that provides screen captures of running youralgorithms with your commentary of the results and your code. At the END of thedocument, include your python source code at the END of the report for referenceand turnitin checking, in TEXT format, NOT screen capture. B
34
B
36
22
24
35
28
39
25
19
23
12
33
21
30