forked from menault/TD1_DEV51_Qualite_Algo
.
This commit is contained in:
23
quicksort.c
23
quicksort.c
@@ -29,27 +29,4 @@ void quicksort(int arr[], int low, int high) {
|
||||
quicksort(arr, low, pi - 1);
|
||||
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;
|
||||
}
|
Reference in New Issue
Block a user