Fix a typo in quick sort implementation

Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>

diff --git a/TP3/tp3.c b/TP3/tp3.c
index 9198ad1e15ba4e245b857e124f170b28e609ee4f..8baa7dcf890d6d1df499f49d0a5c09c78a1b5042 100644 (file)
--- a/TP3/tp3.c
+++ b/TP3/tp3.c
@@ -7,7 +7,7 @@ void AfficheTab(int T[], int n) {
     }
 }
 
-/** This quick sort implementation only work with 2^n array size */
+/** This merge sort implementation only work with 2^n array size */
 void TriFusion(int T[], int n) {
     int i = 0, j = 0, k = 0;
     int* T1;