menault/TD4_DEV51_Qualite_Algo
1
0
Fork 19
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix README.md

Browse Source
This commit is contained in:
Killian SCHIED 2024-11-29 00:29:03 +01:00
parent 718b27ae02
commit 8a58aebdc9
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -84,4 +84,4 @@ int find_rank_student(int student_grade, int* grades_array, int students_number)
## Exercice 4
La complexité algorithmique de l'algorithme dans [sort_algorithm.py](/sort_algorithm.py) est de O(n^2 + 2*m).
La complexité algorithmique de l'algorithme dans [sort_algorithm.py](./sort_algorithm.py) est de O(n^2 + 2*m).