Question: codes: Naive: def input _ deadlines ( ) : deadlines = [ ] while True: user _ input = input ( Enter course name,
codes:
Naive:
def inputdeadlines:
deadlines
while True:
userinput inputEnter course name, week of submission the project, and submission day or 'exit' to stop: strip
if userinput.lower "exit":
break
else:
course, week, day userinput.split
deadlines.appendcoursecapitalize intweek day
return deadlines
def arrangedeadlinesnaivedeadlines:
return sorteddeadlines keylambda x: x:
if namemain:
deadlines inputdeadlines
arrangeddeadlines arrangedeadlinesnaivedeadlines
printArranged Deadlines Naive Approach:
for deadline in arrangeddeadlines:
printdeadline deadline deadline
optmized:
from collections import defaultdict
def inputdeadlines:
deadlines
while True:
userinput inputEnter course name, week of submission the project, and submission day or 'exit' to stop: strip
if userinput.lower "exit":
break
else:
course, week, day userinput.split
deadlines.appendcoursecapitalize intweek day
return deadlines
def arrangedeadlinesoptimizeddeadlines:
deadlinesdict defaultdictlist
for course, week, day in deadlines:
deadlinesdictweekappendcourse day
arrangeddeadlines
for week in sorteddeadlinesdict.keys:
for course, day in sorteddeadlinesdictweek keylambda x: x:
arrangeddeadlines.appendcourse week, day
return arrangeddeadlines
if namemain:
deadlines inputdeadlines
arrangeddeadlines arrangedeadlinesoptimizeddeadlines
printArranged Deadlines Optimized Approach:
for deadline in arrangeddeadlines:
printdeadlinecapitalize deadline deadline
question:
A Test both algorithms with various input sizes and document performance
B Compare theoretical and empirical results, and explain any discrepancies
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
