Problem $1$

Problem Description: Arranging deadlines for project courses is crucial for students taking these courses. The goal of the problem is to arrange the deadlines for submitting course projects from closest to furthest, which helps students organize and plan their assignments and priorities more efficiently and achieve high academic results. The idea of $$the algorithms is that students enter the course name, week, and day of project submission for each project cycle, and then the algorithm arranges the deadlines from closest to furthest, ensuring that projects with the closest deadline are prioritized.

Apply these requirements to the problem:

$1-$ Propose a naive and improved algorithm to solve the problem

problem.

$2-$Implementation: Code both algorithms in a chosen programming language, preferably

Python or C$++.$

$3-$ Theoretical analysis: identifying the temporal and spatial complexities related to both

Algorithms.

$4-$Experimental analysis: Test both algorithms with different input and document sizes

performance.

$5-$ Comparing results: Comparing theoretical and experimental results, and explaining which ones

Contradictions.