final commit (j'espère)

modif/bubblesort.c

@@ -0,0 +1,21 @@
+// Bubblesort Algorithm
+// M.Menault 2024
+
+void bubblesort(int* array, int length)
+{
+	int swapped, i, tmp;
+	do
+	{
+		swapped = 0;
+		for(i=1;i<length;i++)
+		{
+			if(array[i-1] > array[i])
+			{
+				tmp = array[i-1];
+				array[i-1] = array[i];
+				array[i] = tmp;
+				swapped++;
+			}
+		}
+	} while(swapped==1);
+}

modif/heapsort.c

@@ -0,0 +1,80 @@
+// Heapsort Algorithm
+// M.Menault 2024
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+void print_array(int* array, int length)
+{
+    static int count = 0;
+    int i = 0;
+    printf("(%3.3d) Array : ",count++);
+    for(i=0; i < length; i++)
+    {
+        printf("%5d ",array[i]);
+    }
+    printf("\n");
+}
+
+void sift(int* array, int node, int length)
+{
+    int largest_node = node;
+    int left_node = 2*node+1;
+    int right_node = 2*node+2;
+    int temp_value = 0;
+
+    if(left_node < length && array[left_node] > array[largest_node])
+    {
+        largest_node = left_node;
+    }
+
+    if(right_node < length && array[right_node] > array[largest_node])
+    {
+        largest_node = right_node;
+    }
+
+    if(largest_node != node)
+    {
+        temp_value = array[node];
+        array[node] = array[largest_node];
+        array[largest_node] = temp_value;
+        sift(array,length,largest_node);
+    }
+}
+ 
+void heapsort(int* array, int length)
+{
+    int i = 0;
+    int temp_value = 0;
+ 
+    // Sift the current array (binary tree)
+    for(i=(length/2); i >= 0; i--)
+    {
+        sift(array,i,length);
+    }
+    // Heapsort !
+    for(i=length-1; i > 0; i--)
+    {
+        temp_value = array[i];
+        array[i] = array[0];
+        array[0] = temp_value;
+        sift(array,0,i);
+    }
+}
+ 
+void generate_array(int* array, int length)
+{
+    int i = 0;
+    static int first_call = 1;
+
+    if(first_call)
+    {
+	first_call = 0;
+        srand(time(NULL));
+    }
+    for(i=0; i < length; i++)
+    {
+        array[i] = rand() % 20 + 1;
+    }
+}

modif/notes.md

@@ -0,0 +1,172 @@
+compilation :
+```gcc -g -pg -o student_rank student_rank.c heapsort.c bubblesort.c```
+
+
+premier test:
+```./student_rank 5 5 1```
+
+lancement de gprof:
+```gprof ./student_rank```
+
+```Flat profile:
+
+Each sample counts as 0.01 seconds.
+ no time accumulated
+
+  %   cumulative   self              self     total
+ time   seconds   seconds    calls  Ts/call  Ts/call  name
+  0.00      0.00     0.00       30     0.00     0.00  bubblesort
+  0.00      0.00     0.00       25     0.00     0.00  find_rank_student
+  0.00      0.00     0.00       10     0.00     0.00  print_array
+  0.00      0.00     0.00        5     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
+
+```
+
+30 appel de bubblesort et 25 appel de find_rank_student
+
+call graph :
+```                     Call graph (explanation follows)
+
+
+granularity: each sample hit covers 2 byte(s) no time propagated
+
+index % time    self  children    called     name
+                0.00    0.00       5/30          sort_students [9]
+                0.00    0.00      25/30          find_rank_student [2]
+[1]      0.0    0.00    0.00      30         bubblesort [1]
+-----------------------------------------------
+                0.00    0.00      25/25          sort_students [9]
+[2]      0.0    0.00    0.00      25         find_rank_student [2]
+                0.00    0.00      25/30          bubblesort [1]
+-----------------------------------------------
+                0.00    0.00      10/10          print_student_array [6]
+[3]      0.0    0.00    0.00      10         print_array [3]
+-----------------------------------------------
+                0.00    0.00       5/5           generate_grades [7]
+[4]      0.0    0.00    0.00       5         generate_array [4]
+-----------------------------------------------
+                0.00    0.00       2/2           main [16]
+[5]      0.0    0.00    0.00       2         free_array [5]
+-----------------------------------------------
+                0.00    0.00       2/2           main [16]
+[6]      0.0    0.00    0.00       2         print_student_array [6]
+                0.00    0.00      10/10          print_array [3]
+-----------------------------------------------
+                0.00    0.00       1/1           main [16]
+[7]      0.0    0.00    0.00       1         generate_grades [7]
+                0.00    0.00       5/5           generate_array [4]
+-----------------------------------------------
+                0.00    0.00       1/1           main [16]
+[8]      0.0    0.00    0.00       1         generate_ranks [8]
+-----------------------------------------------
+                0.00    0.00       1/1           main [16]
+[9]      0.0    0.00    0.00       1         sort_students [9]
+                0.00    0.00      25/25          find_rank_student [2]
+                0.00    0.00       5/30          bubblesort [1]
+-----------------------------------------------
+
+```
+
+- 30 appel de bubblesort
+- 5 appel de sort_student
+- 25 appel de find_rank_student<br>
+sort_student appel 25 fois find_rank_student et 5 fois bubblesort<br>
+find_rank_student appel 25 fois bubblesort
+
+nouveau scénario via la commande suivante :
+```./student_rank 1000 1000 0```
+
+lancement de gprof :
+```gprof ./student_rank```
+
+résultats:
+```Flat profile:
+
+Each sample counts as 0.01 seconds.
+  %   cumulative   self              self     total
+ time   seconds   seconds    calls   s/call   s/call  name
+ 83.16      5.11     5.11  1001000     0.00     0.00  bubblesort
+ 16.30      6.11     1.00  1000000     0.00     0.00  find_rank_student
+  0.65      6.15     0.04        1     0.04     6.15  sort_students
+  0.00      6.15     0.00     1000     0.00     0.00  generate_array
+  0.00      6.15     0.00        2     0.00     0.00  free_array
+  0.00      6.15     0.00        1     0.00     0.00  generate_grades
+  0.00      6.15     0.00        1     0.00     0.00  generate_ranks
+  
+  ```
+
+- 1001000 appel de bubblesort
+- 1000000 appel de find_rank_student<br>
+execution du programme en 6.15s
+
+call graph :
+```                     Call graph (explanation follows)
+
+
+granularity: each sample hit covers 2 byte(s) for 0.16% of 6.15 seconds
+
+index % time    self  children    called     name
+                0.04    6.11       1/1           main [2]
+[1]    100.0    0.04    6.11       1         sort_students [1]
+                1.00    5.10 1000000/1000000     find_rank_student [3]
+                0.01    0.00    1000/1001000     bubblesort [4]
+-----------------------------------------------
+                                                 <spontaneous>
+[2]    100.0    0.00    6.15                 main [2]
+                0.04    6.11       1/1           sort_students [1]
+                0.00    0.00       2/2           free_array [6]
+                0.00    0.00       1/1           generate_grades [7]
+                0.00    0.00       1/1           generate_ranks [8]
+-----------------------------------------------
+                1.00    5.10 1000000/1000000     sort_students [1]
+[3]     99.3    1.00    5.10 1000000         find_rank_student [3]
+                5.10    0.00 1000000/1001000     bubblesort [4]
+-----------------------------------------------
+                0.01    0.00    1000/1001000     sort_students [1]
+                5.10    0.00 1000000/1001000     find_rank_student [3]
+[4]     83.1    5.11    0.00 1001000         bubblesort [4]
+-----------------------------------------------
+                0.00    0.00    1000/1000        generate_grades [7]
+[5]      0.0    0.00    0.00    1000         generate_array [5]
+-----------------------------------------------
+                0.00    0.00       2/2           main [2]
+[6]      0.0    0.00    0.00       2         free_array [6]
+-----------------------------------------------
+                0.00    0.00       1/1           main [2]
+[7]      0.0    0.00    0.00       1         generate_grades [7]
+                0.00    0.00    1000/1000        generate_array [5]
+-----------------------------------------------
+                0.00    0.00       1/1           main [2]
+[8]      0.0    0.00    0.00       1         generate_ranks [8]
+-----------------------------------------------
+
+```
+
+## arbre d'appel du programme : ##
+<pre>
+main
+|-->generate_grades
+|       |-->generate_array
+|-->generate_ranks
+|-->sort_students
+|       |-->find_rank_student
+|       |            |-->bubblesort
+|       |-->bubblesort
+|-->free_array
+</pre>
+
+## optimisation du programme : ##
+
+- réduire les appel de bubblesort
+- optimiser bubbesort (plus complexe)
+- réduire les appel de sort_student car elle appelle les autres fonctions
+
+### changmenent effectué : ###
+suppression de la ligne 58 de student_rank.c
+
+bubblesort.c est déjà optimisé

modif/student_rank.c

@@ -0,0 +1,125 @@
+// Student rank
+// M.Menault 2024
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "heapsort.h"
+#include "bubblesort.h"
+
+void generate_grades(int** students_array, int students_number, int grades_number)
+{
+    int i = 0;
+    for(i=0;i<students_number;i++)
+    {
+	students_array[i] = (int*) malloc(grades_number*sizeof(int));
+        generate_array(students_array[i],grades_number);
+    }
+}
+
+void generate_ranks(int** students_array, int students_number, int grades_number)
+{
+    int i = 0;
+    int j = 0;
+    for(i=0;i<students_number;i++)
+    {
+	students_array[i] = (int*) malloc(grades_number*sizeof(int));
+        for(j=0;j<grades_number;j++)
+	{
+            students_array[i][j] = -1;
+	}
+    }
+}
+
+void free_array(int** students_array, int students_number)
+{
+    int i = 0;
+    for(i=0;i<students_number;i++)
+    {
+        free(students_array[i]);
+    }
+}
+
+void print_student_array(int** students_array, int students_number, int grades_number)
+{
+    int i = 0;
+    printf("----------------------\n");
+    for(i=0;i<students_number;i++)
+    {
+	printf("Student %d : ",i);
+        print_array(students_array[i],grades_number);
+    }
+    printf("----------------------\n");
+}
+
+int find_rank_student(int student_grade, int* grades_array, int students_number)
+{
+    int position = -1;
+    int i = 0;
+    //bubblesort(grades_array,students_number); tableau déjà trié
+    for(i = students_number-1; i >= 0; i--)
+    {
+        if(grades_array[i] == student_grade)
+	{
+            position = students_number-i;
+	    break;
+	}
+    }
+    return position;
+}
+
+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++)
+	{
+            students_rank[j][i] = find_rank_student(students_array[j][i],grades,students_number);
+	}
+	free(grades);
+    }
+}
+
+int main(int argc, char** argv)
+{
+    int** student_grades = NULL;
+    int** student_ranks = NULL;
+    int students_length = 0;
+    int grades_length = 0;
+    int debug_mode = 0;
+    
+    if(argc != 4)
+    {
+        printf("Usage : %s <number of student> <number of grade per student> <debug mode : 0|1>\n",argv[0]);
+        return -1;
+    }
+    students_length = atoi(argv[1]);
+    grades_length = atoi(argv[2]);
+    debug_mode = atoi(argv[3]);
+
+    student_grades = (int**) malloc(students_length*sizeof(int*));
+    student_ranks = (int**) malloc(students_length*sizeof(int*));
+    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);
+    
+    if(debug_mode)
+    {
+        print_student_array(student_grades,students_length,grades_length);
+        print_student_array(student_ranks,students_length,grades_length);
+    }
+
+    free_array(student_grades,students_length);
+    free_array(student_ranks,students_length);
+    free(student_grades);
+    free(student_ranks);
+    return 0;
+}
+

test.txt

@@ -0,0 +1,272 @@
+Flat profile:
+
+Each sample counts as 0.01 seconds.
+  %   cumulative   self              self     total           
+ time   seconds   seconds    calls  Ts/call  Ts/call  name    
+
+ %         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-2023 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) no time propagated
+
+index % time    self  children    called     name
+
+ 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
+ `<spontaneous>' 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-2023 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
+
+Flat profile:
+
+Each sample counts as 0.01 seconds.
+  %   cumulative   self              self     total           
+ time   seconds   seconds    calls  Ts/call  Ts/call  name    
+
+ %         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-2023 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) no time propagated
+
+index % time    self  children    called     name
+
+ 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
+ `<spontaneous>' 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-2023 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
+