2 Commits

Author SHA1 Message Date
Yanis DARIUS 40bed0cb34 ajout du compte rendu 2024-10-15 10:15:10 +02:00
Yanis DARIUS 1043182b8b fin premeierer seance 2024-09-03 12:18:08 +02:00
4 changed files with 79 additions and 56 deletions
+25
View File
@@ -0,0 +1,25 @@
premiere execution de gprof avec les arguments 100 10 1
% cumulative self self total
time seconds seconds calls Ts/call Ts/call name
0.00 0.00 0.00 1010 0.00 0.00 bubblesort
0.00 0.00 0.00 1000 0.00 0.00 find_rank_student
0.00 0.00 0.00 200 0.00 0.00 print_array
0.00 0.00 0.00 100 0.00 0.00 generate_array
0.00 0.00 0.00 2 0.00 0.00 free_array
0.00 0.00 0.00 2 0.00 0.00 print_student_array
0.00 0.00 0.00 1 0.00 0.00 generate_grades
0.00 0.00 0.00 1 0.00 0.00 generate_ranks
0.00 0.00 0.00 1 0.00 0.00 sort_students
Resultat pas tres interessant
deuxieme execution de gprof avec les arguments 1000 1000
test avec les argument 1000 10000 0
le programme a pris 30 secondes et on a remarquer que cetait bubulesort qui prend
le plus de temps a executer
finalement on va modifier le nombre de fois est appeler bubulle sort
on va essayer de profiller un de notre code
BIN
View File
Binary file not shown.
Executable
BIN
View File
Binary file not shown.
-2
View File
@@ -55,7 +55,6 @@ int find_rank_student(int student_grade, int* grades_array, int students_number)
{ {
int position = -1; int position = -1;
int i = 0; int i = 0;
bubblesort(grades_array,students_number);
for (i = students_number - 1; i >= 0; i--) for (i = students_number - 1; i >= 0; i--)
{ {
if (grades_array[i] == student_grade) if (grades_array[i] == student_grade)
@@ -122,4 +121,3 @@ int main(int argc, char** argv)
free(student_ranks); free(student_ranks);
return 0; return 0;
} }