vaisse/TD1_DEV51_Qualite_Algo
1
0
Fork 0
forked from menault/TD1_DEV51_Qualite_Algo
Code Pull Requests Activity

taf fait

Browse Source
This commit is contained in:
vaisse
2025-09-10 16:37:41 +02:00
parent ca552281c9
commit 533d7685ca
5 changed files with 31 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
student_rank.c
View File

@@ -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);
(grades_array,students_number);
for(i = students_number-1; i >= 0; i--)
{
if(grades_array[i] == student_grade)
@@ -73,16 +73,16 @@ void sort_students(int** students_rank, int** students_array, int students_numbe
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);
for(j = 0; j < students_number; j++)
{
grades[j] = students_array[j][i];
}
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);
}
}
@@ -93,6 +93,7 @@ int main(int argc, char** argv)
int students_length = 0;
int grades_length = 0;
int debug_mode = 0;
int* ranker = NULL;
if(argc != 4)
{