#include <stdio.h>
#include <malloc.h>
#include <omp.h>
#include <math.h>
#define N 25000

int main (int argc, char *argv[])
 {
   //  int *a;
   int a[N];
  int i,j,tmp;
  double start,end;
  
  if (argc < 2) 
   {
    printf("Usage omp_bubble.exe <number_of_threads>\n");
    exit(0);
   }
  if (!omp_get_dynamic()) 
   {
    //Set the number of threads 
    omp_set_num_threads(atoi(argv[1]));
   }
  else
   {
    printf("ERROR: set OMP_DYNAMIC=FALSE\n");
    exit(0);
   }

  //a = (int *) malloc(N * sizeof(int));
  printf("Unsorted\n");
//  j=0;
//  for (i=N; i>0; i--) { a[j] = i; printf("%d\n",a[j]); j++; }

  start = omp_get_wtime();
  #pragma omp parallel for
  for (i=0; i<N; i++) { a[i] = rand(); } // printf("%d\n",a[i]); }
  end = omp_get_wtime();
  printf("Creating %ld random integers took %0.6f seconds with %d threads\n",N,end-start,omp_get_max_threads());

  start = omp_get_wtime();
  for (i=0; i<(N/2); i++)
   {
    #pragma omp parallel for schedule(runtime)
    for(j=0; j<(N-1); j+=2) 
     if (a[j] > a[j+1]) 
      {
       tmp = a[j+1];
       a[j+1] = a[j];
       a[j] = tmp;
      }
    #pragma omp parallel for schedule(runtime)
    for(j=1; j<(N-1); j+=2) 
     if (a[j] > a[j+1]) 
      {
       tmp = a[j+1];
       a[j+1] = a[j];
       a[j] = tmp;
      }
   }  
  end = omp_get_wtime();
  printf("\nSorted\n");
  for (i=0; i<N; i++) printf("%d\n",a[i]); 
  printf("Sorting %ld integers took %0.6f seconds with %d threads\n",N,end-start,omp_get_max_threads());
  //printf("%d\t%ld\t%0.6f\n",omp_get_max_threads(),N,end-start);
 }