#include <stdio.h>
#include <math.h>
#define N 10

int main (int argc, char *argv[])
 {
   int a[N];
   long iter=0;
   int i,j,tmp;
   long clock(),end;
  
   printf("Unsorted\n");
   for (i=0; i<N; i++) { a[i] = rand(); printf("%d\n",a[i]); }
   clock();
   for (i=0; i<(N-1); i++)
    for(j=(N-1); j>i; j--)
     {
      iter++;
      if (a[j-1] > a[j])
       {
        tmp = a[j];
        a[j] = a[j-1];
        a[j-1] = tmp;
       }
     }
   end = clock();
   printf("\nSorted\n");
   for (i=0; i<N; i++) printf("%d\n",a[i]); 
   printf("Sorting %ld integers took %0.6f seconds %d iterations\n",N,end/1.0e+3,iter);
 }