Inversion

Inv.java

public class Inv
{
  public static int array_inversion_count(int array[])
  {
    int inversion_counter = 0;
    for(int p=0;p<array.length;p++)
    {
      for(int q=0;q<array.length;q++)
      {
        if((p<q) && (array[q]<array[p]))
          inversion_counter += 1;
      }
    }
    if (inversion_counter > 1000000000 )
      return -1;
    else
    return inversion_counter;
  }

  public static void main(String args[])
  {
    int array[] = {-1, 6, 3, 4, 7, 4};
    System.out.println(array_inversion_count(array)); 
  }//end main
}