FINISH: Tri insertion

Algos_1/main.c

@@ -27,13 +27,13 @@ int main(int argc, char **argv){
         printf("n:%d\n", n);
         printf("Base      : ");
         for(int i  = 0; i<n; i++){
-            // printf("i:%d cont:%ld\n", i, tab[i]);
+            printf("%ld-", tab[i]);
         }
         printf("\n");
         triInsertion(tab, n);
         printf("Insertion : ");
         for(int i  = 0; i<n; i++){
-            // printf("i:%d cont:%ld\n", i, tab[i]);
+            printf("%ld-", tab[i]);
         }
         printf("\n");
         free(tab);

Algos_1/perf.sh

@@ -5,7 +5,7 @@ echo -e "iTest\ttaille\ttri\ttemps\tmem"
 for iTest in `seq 1 2`
 do
     size=$(( `od -An -N4 -tu < /dev/urandom` % 1000000))
-    max=$(( `od -An -N4 -tu < /dev/urandom` % 100000))
+    max=$(( `od -An -N4 -tu < /dev/urandom` % 1000))
 
     ./tri -g $max $size 1>tabs/perf_tab.txt
     #cat tabs/perf_tab.txt

Algos_1/triInsertion.c

@@ -2,11 +2,10 @@
 
 void triInsertion(long* A, size_t n){
     long cle = 0;
-    size_t max = 0; max--;
     for(size_t i = 1; i<n; i++){
         cle=A[i];
         size_t j = i - 1;
-        while (j != max && A[j] > cle ){
+        while (j+1 > 0 && A[j] > cle ){
             A[j+1] = A[j];
             j = j-1;
         }
@@ -14,18 +13,19 @@ void triInsertion(long* A, size_t n){
     }
 }
 
+
+
 // --------------------------------------------------------
 
 void triInsertionVerbose(long* A, size_t n, struct data* d){
     long cle = 0; 
-    size_t max = 0; max--;
     d->write++;
     for(size_t i = 1; i<n; i++){
         cle=A[i];
         d->write++;
         size_t j = i - 1;
         d->write++;
-        while (j != max && A[j] > cle ){
+        while (j+1 > 0 && A[j] > cle ){
             d->comparison+=2;
             A[j+1] = A[j];
             d->write++;