title: Count Inversions Of Size Three In A Give Array 1
signature: countInversionsOfSizeThreeInAGiveArray1(arr, n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(arr, n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [4, 75, 89], 1, 
          0)
      }");
  
      print("TEST-1...${driver(
          [84, -66, -52, 34, -28, -6, 20, 22, -78, -26, 14, 24, -92, -18, 32, -94, -64, -38, 56, 4, -10, 58, -66, -58, -10, -8, -62, -60, -26], 26, 
          404)
      }");
  
      print("TEST-2...${driver(
          [0, 0, 0, 1, 1, 1, 1, 1], 7, 
          0)
      }");
  
      print("TEST-3...${driver(
          [18, 7, 43, 57, 94, 37, 38, 41, 59, 64, 97, 29, 51, 37, 64, 91, 42, 83, 13, 22, 68], 17, 
          37)
      }");
  
      print("TEST-4...${driver(
          [-94, -86, -84, -84, -82, -66, -62, -58, -52, -48, -44, -40, -38, -32, -22, -22, -22, -14, -8, -6, -6, 0, 2, 20, 20, 26, 32, 32, 52, 56, 66, 74, 76, 80, 80, 86, 88, 94], 34, 
          0)
      }");
  
      print("TEST-5...${driver(
          [0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0], 9, 
          0)
      }");
  
      print("TEST-6...${driver(
          [4, 8, 15, 19, 24, 31, 33, 36, 38, 45, 45, 52, 54, 65, 73, 75, 83, 84, 90, 92, 93], 19, 
          0)
      }");
  
      print("TEST-7...${driver(
          [80, -30, -44, 76, -96, 2, 22, -30, 36, -6, 88, -60, -90, -52, 78, 90, -52], 10, 
          20)
      }");
  
      print("TEST-8...${driver(
          [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], 7, 
          0)
      }");
  
      print("TEST-9...${driver(
          [74, 71, 28, 45, 14, 31, 17, 10, 82, 27, 45, 73, 93, 87, 57, 58], 10, 
          43)
      }");
  
      return 0;
  }
source_py: def count_inversions_of_size_three_in_a_give_array_1(arr, n):
      invcount = 0
      for i in range(1, (n - 1)):
          small = 0
          for j in range((i + 1), n):
              if (arr[i] > arr[j]):
                  small += 1
          great = 0
          for j in range((i - 1), (- 1), (- 1)):
              if (arr[i] < arr[j]):
                  great += 1
          invcount += (great * small)
      return invcount
source_cpp: int count_inversions_of_size_three_in_a_give_array_1(vector<int> arr, int n) {
    int invcount = 0;
    for ( int i = 1;
    i < n - 1;
    i ++ ) {
      int small = 0;
      for ( int j = i + 1;
      j < n;
      j ++ ) if ( arr [ i ] > arr [ j ] ) small ++;
      int great = 0;
      for ( int j = i - 1;
      j >= 0;
      j -- ) if ( arr [ i ] < arr [ j ] ) great ++;
      invcount += great * small;
    }
    return invcount;
  }