diff --git a/contrerendu.txt b/contrerendu.txt new file mode 100644 index 0000000..d2d8c36 --- /dev/null +++ b/contrerendu.txt @@ -0,0 +1,715 @@ +commande pour lire le gmon.out + gprof .\student_rank.exe + +-b + +pour retirer les info/legendes (que les graph) + + +yavait 2 bubblesort dont 1 inutile + +le prof a gaffé sur sont push et a deja mis le bubblesort opti + +================================================================================= +``` +Flat profile: #graph de temp par fonction + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls s/call s/call name + 79.74 23.38 23.38 10010000 0.00 0.00 bubblesort + 19.46 29.09 5.71 10000000 0.00 0.00 find_rank_student + 0.67 29.28 0.20 1 0.20 29.28 sort_students + 0.10 29.31 0.03 1000 0.00 0.00 generate_array + 0.03 29.32 0.01 1 0.01 0.01 generate_ranks + 0.00 29.32 0.00 2 0.00 0.00 free_array + 0.00 29.32 0.00 1 0.00 0.03 generate_grades + + Call graph + #arbre d'appel et temp dexecution total en haut + +granularity: each sample hit covers 4 byte(s) for 0.03% of 29.32 seconds + +index % time self children called name + +[1] 100.0 0.00 29.32 main [1] + 0.20 29.09 1/1 sort_students [2] + 0.00 0.03 1/1 generate_grades [6] + 0.01 0.00 1/1 generate_ranks [7] + 0.00 0.00 2/2 free_array [9] +----------------------------------------------- + 0.20 29.09 1/1 main [1] +[2] 99.9 0.20 29.09 1 sort_students [2] + 5.71 23.36 10000000/10000000 find_rank_student [3] + 0.02 0.00 10000/10010000 bubblesort [4] +----------------------------------------------- + 5.71 23.36 10000000/10000000 sort_students [2] +[3] 99.1 5.71 23.36 10000000 find_rank_student [3] + 23.36 0.00 10000000/10010000 bubblesort [4] +----------------------------------------------- + 0.02 0.00 10000/10010000 sort_students [2] + 23.36 0.00 10000000/10010000 find_rank_student [3] +[4] 79.7 23.38 0.00 10010000 bubblesort [4] +----------------------------------------------- + 0.03 0.00 1000/1000 generate_grades [6] +[5] 0.1 0.03 0.00 1000 generate_array [5] +----------------------------------------------- + 0.00 0.03 1/1 main [1] +[6] 0.1 0.00 0.03 1 generate_grades [6] + 0.03 0.00 1000/1000 generate_array [5] +----------------------------------------------- + 0.01 0.00 1/1 main [1] +[7] 0.0 0.01 0.00 1 generate_ranks [7] +----------------------------------------------- + 0.00 0.00 2/2 main [1] +[9] 0.0 0.00 0.00 2 free_array [9] +----------------------------------------------- + +Index by function name + + [4] bubblesort [5] generate_array [2] sort_students + [3] find_rank_student [6] generate_grades + [9] free_array [7] generate_ranks + +``` + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +============================== +output moche: +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls ms/call ms/call name + 75.00 0.03 0.03 101000 0.00 0.00 bubblesort + 25.00 0.04 0.01 100000 0.00 0.00 find_rank_student + 0.00 0.04 0.00 100 0.00 0.00 generate_array + 0.00 0.04 0.00 2 0.00 0.00 free_array + 0.00 0.04 0.00 1 0.00 0.00 generate_grades + 0.00 0.04 0.00 1 0.00 0.00 generate_ranks + 0.00 0.04 0.00 1 0.00 40.00 sort_students + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + +=================================== + +arbre d'appel ci dessous + +a droite qui appel qui/quoi + + + +=================================== + +granularity: each sample hit covers 4 byte(s) for 25.00% of 0.04 seconds + +index % time self children called name + 0.00 0.04 1/1 main [2] +[1] 100.0 0.00 0.04 1 sort_students [1] + 0.01 0.03 100000/100000 find_rank_student [3] + 0.00 0.00 1000/101000 bubblesort [4] +----------------------------------------------- + +[2] 100.0 0.00 0.04 main [2] + 0.00 0.04 1/1 sort_students [1] + 0.00 0.00 2/2 free_array [7] + 0.00 0.00 1/1 generate_grades [8] + 0.00 0.00 1/1 generate_ranks [9] +----------------------------------------------- + 0.01 0.03 100000/100000 sort_students [1] +[3] 99.3 0.01 0.03 100000 find_rank_student [3] + 0.03 0.00 100000/101000 bubblesort [4] +----------------------------------------------- + 0.00 0.00 1000/101000 sort_students [1] + 0.03 0.00 100000/101000 find_rank_student [3] +[4] 75.0 0.03 0.00 101000 bubblesort [4] +----------------------------------------------- + 0.00 0.00 100/100 generate_grades [8] +[6] 0.0 0.00 0.00 100 generate_array [6] +----------------------------------------------- + 0.00 0.00 2/2 main [2] +[7] 0.0 0.00 0.00 2 free_array [7] +----------------------------------------------- + 0.00 0.00 1/1 main [2] +[8] 0.0 0.00 0.00 1 generate_grades [8] + 0.00 0.00 100/100 generate_array [6] +----------------------------------------------- + 0.00 0.00 1/1 main [2] +[9] 0.0 0.00 0.00 1 generate_ranks [9] +----------------------------------------------- + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + + [4] bubblesort [6] generate_array [1] sort_students + [3] find_rank_student [8] generate_grades + [7] free_array [9] generate_ranks +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls s/call s/call name + 74.25 1.73 1.73 1001000 0.00 0.00 bubblesort + 24.46 2.30 0.57 1000000 0.00 0.00 find_rank_student + 0.86 2.32 0.02 1 0.02 2.32 sort_students + 0.43 2.33 0.01 1000 0.00 0.00 generate_array + 0.00 2.33 0.00 2 0.00 0.00 free_array + 0.00 2.33 0.00 1 0.00 0.01 generate_grades + 0.00 2.33 0.00 1 0.00 0.00 generate_ranks + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 4 byte(s) for 0.43% of 2.33 seconds + +index % time self children called name + +[1] 100.0 0.00 2.33 main [1] + 0.02 2.30 1/1 sort_students [2] + 0.00 0.01 1/1 generate_grades [6] + 0.00 0.00 2/2 free_array [8] + 0.00 0.00 1/1 generate_ranks [9] +----------------------------------------------- + 0.02 2.30 1/1 main [1] +[2] 99.6 0.02 2.30 1 sort_students [2] + 0.57 1.73 1000000/1000000 find_rank_student [3] + 0.00 0.00 1000/1001000 bubblesort [4] +----------------------------------------------- + 0.57 1.73 1000000/1000000 sort_students [2] +[3] 98.6 0.57 1.73 1000000 find_rank_student [3] + 1.73 0.00 1000000/1001000 bubblesort [4] +----------------------------------------------- + 0.00 0.00 1000/1001000 sort_students [2] + 1.73 0.00 1000000/1001000 find_rank_student [3] +[4] 74.2 1.73 0.00 1001000 bubblesort [4] +----------------------------------------------- + 0.01 0.00 1000/1000 generate_grades [6] +[5] 0.4 0.01 0.00 1000 generate_array [5] +----------------------------------------------- + 0.00 0.01 1/1 main [1] +[6] 0.4 0.00 0.01 1 generate_grades [6] + 0.01 0.00 1000/1000 generate_array [5] +----------------------------------------------- + 0.00 0.00 2/2 main [1] +[8] 0.0 0.00 0.00 2 free_array [8] +----------------------------------------------- + 0.00 0.00 1/1 main [1] +[9] 0.0 0.00 0.00 1 generate_ranks [9] +----------------------------------------------- + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + + [4] bubblesort [5] generate_array [2] sort_students + [3] find_rank_student [6] generate_grades + [8] free_array [9] generate_ranks +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls s/call s/call name + 74.69 1.83 1.83 1001000 0.00 0.00 bubblesort + 24.49 2.43 0.60 1000000 0.00 0.00 find_rank_student + 0.82 2.45 0.02 1 0.02 2.45 sort_students + 0.00 2.45 0.00 1000 0.00 0.00 generate_array + 0.00 2.45 0.00 2 0.00 0.00 free_array + 0.00 2.45 0.00 1 0.00 0.00 generate_grades + 0.00 2.45 0.00 1 0.00 0.00 generate_ranks + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 4 byte(s) for 0.41% of 2.45 seconds + +index % time self children called name + 0.02 2.43 1/1 main [2] +[1] 100.0 0.02 2.43 1 sort_students [1] + 0.60 1.83 1000000/1000000 find_rank_student [3] + 0.00 0.00 1000/1001000 bubblesort [4] +----------------------------------------------- + +[2] 100.0 0.00 2.45 main [2] + 0.02 2.43 1/1 sort_students [1] + 0.00 0.00 2/2 free_array [7] + 0.00 0.00 1/1 generate_grades [8] + 0.00 0.00 1/1 generate_ranks [9] +----------------------------------------------- + 0.60 1.83 1000000/1000000 sort_students [1] +[3] 99.1 0.60 1.83 1000000 find_rank_student [3] + 1.83 0.00 1000000/1001000 bubblesort [4] +----------------------------------------------- + 0.00 0.00 1000/1001000 sort_students [1] + 1.83 0.00 1000000/1001000 find_rank_student [3] +[4] 74.7 1.83 0.00 1001000 bubblesort [4] +----------------------------------------------- + 0.00 0.00 1000/1000 generate_grades [8] +[6] 0.0 0.00 0.00 1000 generate_array [6] +----------------------------------------------- + 0.00 0.00 2/2 main [2] +[7] 0.0 0.00 0.00 2 free_array [7] +----------------------------------------------- + 0.00 0.00 1/1 main [2] +[8] 0.0 0.00 0.00 1 generate_grades [8] + 0.00 0.00 1000/1000 generate_array [6] +----------------------------------------------- + 0.00 0.00 1/1 main [2] +[9] 0.0 0.00 0.00 1 generate_ranks [9] +----------------------------------------------- + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2017 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + + [4] bubblesort [6] generate_array [1] sort_students + [3] find_rank_student [8] generate_grades + [7] free_array [9] generate_ranks diff --git a/gmon.out b/gmon.out new file mode 100644 index 0000000..635866a Binary files /dev/null and b/gmon.out differ diff --git a/out2.txt b/out2.txt new file mode 100644 index 0000000..8811a56 Binary files /dev/null and b/out2.txt differ diff --git a/out3.txt b/out3.txt new file mode 100644 index 0000000..f4f4f8b Binary files /dev/null and b/out3.txt differ diff --git a/student_rank.c b/student_rank.c index af84003..ba3bfbe 100644 --- a/student_rank.c +++ b/student_rank.c @@ -55,7 +55,7 @@ int find_rank_student(int student_grade, int* grades_array, int students_number) { int position = -1; int i = 0; - bubblesort(grades_array,students_number); + /*bubblesort(grades_array,students_number);*/ for(i = students_number-1; i >= 0; i--) { if(grades_array[i] == student_grade) @@ -66,23 +66,27 @@ int find_rank_student(int student_grade, int* grades_array, int students_number) } return position; } - +/* !!!!! +students_number arg 1 +grades_number arg 2 + */ void sort_students(int** students_rank, int** students_array, int students_number, int grades_number) { int i = 0, j = 0; for(i = 0; i < grades_number; i++) { int * grades = (int*) malloc(students_number*sizeof(int)); - for(j = 0; j < students_number; j++) - { - grades[j] = students_array[j][i]; - } - bubblesort(grades,students_number); - for(j = 0; j < students_number; j++) - { + for(j = 0; j < students_number; j++) + { + grades[j] = students_array[j][i]; + } + //bubblesort(grades,students_number); + heapsort(grades,students_number); + for(j = 0; j < students_number; j++) + { students_rank[j][i] = find_rank_student(students_array[j][i],grades,students_number); - } - free(grades); + } + free(grades); } } @@ -108,7 +112,7 @@ int main(int argc, char** argv) generate_grades(student_grades,students_length,grades_length); generate_ranks(student_ranks,students_length,grades_length); - sort_students(student_ranks,student_grades,students_length,grades_length); + sort_students(student_ranks,student_grades,students_length,grades_length); /*!!!!!!*/ if(debug_mode) { diff --git a/student_rank.exe b/student_rank.exe new file mode 100644 index 0000000..524ab57 Binary files /dev/null and b/student_rank.exe differ