.

quicksort.c

@@ -30,26 +30,3 @@ void quicksort(int arr[], int low, int high) {
         quicksort(arr, pi + 1, high);
     }
 }
-
-// Fonction d'affichage
-void printArray(int arr[], int size) {
-    for (int i = 0; i < size; i++)
-        printf("%d ", arr[i]);
-    printf("\n");
-}
-
-// Programme principal
-int main() {
-    int arr[] = {64, 34, 25, 12, 22, 11, 90};
-    int n = sizeof(arr) / sizeof(arr[0]);
-
-    printf("Tableau original:\n");
-    printArray(arr, n);
-
-    quicksort(arr, 0, n - 1);
-
-    printf("Tableau trie (QuickSort):\n");
-    printArray(arr, n);
-
-    return 0;
-}

quicksort.h

@@ -0,0 +1,8 @@
+#ifndef __QUICKSORT__
+#define __QUICKSORT__
+
+void swap(int *a, int *b);
+int partition(int arr[], int low, int high);
+void quickshort(int arr[], int low, int high);
+
+#endif

student_rank.c

@@ -5,6 +5,7 @@
 #include <stdlib.h>
 #include "heapsort.h"
 #include "bubblesort.h"
+#include "quicksort.h"
 
 void generate_grades(int** students_array, int students_number, int grades_number)
 {