#include<iostream>
#include<iomanip>
#include<stdlib.h>
#include<bibli_fonctions.h>
using namespace std;

/* Classement des elements d'un tableau par ordre croissant */

int main(){
  int i, j, N = 10;
  double nn;
  double* tabl;

  tabl = (double*)malloc(N * sizeof(double));
  ini_D_1(tabl, N, 0.4, 0.6, 0.3, 0.3, -0.3, 0.3, 0.1, 0.2, 0.5, -0.5);
  cout << "Tableau initial : ";
  for (i = 0; i < N; i++)
    cout << setw(5) << tabl[i];
  cout << endl;
  for (i = 1; i < N; i++){
    nn = tabl[i];
    for (j = i-1; j >= 0; j--)
      if (nn >= tabl[j])
	break;
      else
	tabl[j+1] = tabl[j];
    tabl[j+1] = nn;
  }
  cout << "Tableau final :   ";
  for (i = 0; i < N; i++)
    cout << setw(5) << tabl[i];
  cout << endl;
  free(tabl);
  return 0;
}