From: Jérôme Benoit <jerome.benoit@piment-noir.org>
Date: Tue, 14 Feb 2017 21:50:42 +0000 (+0100)
Subject: sortFirst(): only change the return value once, not at every iteration
X-Git-Url: https://git.piment-noir.org/?p=TD_C.git;a=commitdiff_plain;h=9bd6197002ea6286b8542d185dda98dc3a330cbe

sortFirst(): only change the return value once, not at every iteration
when a permutation is done.

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

diff --git a/exo1/exo1.c b/exo1/exo1.c
index 8b44ea4..b4bf35d 100644
--- a/exo1/exo1.c
+++ b/exo1/exo1.c
@@ -32,11 +32,13 @@ void displayArray(int* array, int count) {
 
 bool sortFirst(int* array, int length) {
     bool rt = false;
+    // This loop could probably be replaced by a while loop with conditions
+    // on the array values permutation AND the iteration value, later ...
     for (int i = 0; i < length-1; i++) {
         if (array[i] > array[i+1]) {
             swap(&array[i], &array[i+1]);
             //xorSwap(&array[i], &array[i+1]);
-            rt = true;
+            if (!rt) { rt = true; };
         }
     }
     return rt;