Array Partition Equal Sum

/**
Split an array into two equal Sum subarrays
Given an array of integers greater than zero, find if it is possible to split it in two subarrays (without reordering the elements), such that the sum of the two subarrays is the same. Print the two subarrays.

Examples :

Input : Arr[] = { 1 , 2 , 3 , 4 , 5 , 5  }
Output :  { 1 2 3 4 }
          { 5 , 5 }

Input : Arr[] = { 4, 1, 2, 3 }
Output : {4 1}
         {2 3}

Input : Arr[] = { 4, 3, 2, 1}
Output : Not Possible
*/
public class ArrayPartEqualSum{

// Returns split point. If not possible, then
    // return -1.
    static int findSplitPoint(int arr[], int n)
    {
   
    // traverse array element and compute sum
    // of whole array
    int leftSum = 0;
   
    for (int i = 0 ; i < n ; i++)
        leftSum += arr[i];

    // again traverse array and compute right
    // sum and also check left_sum equal to
    // right sum or not
    int rightSum = 0;
   
    for (int i = n-1; i >= 0; i--)
    {
        // add current element to right_sum
        rightSum += arr[i];

        // exclude current element to the left_sum
        leftSum -= arr[i] ;

        if (rightSum == leftSum)
            return i ;
    }

    // if it is not possible to split array
    // into two parts.
    return -1;
    }

}