prefix sum for array splitting

// we can check whether we can split an array into two equal subarrays using prefix sum technique and if at any point during the splitting of an array if prefix[i] equals 2*prefix[n-1] we can divide the array into two equal subarray sums

bool canSplit(vector<int>& arr) {
      int total_sum=0;
      vector<int>prefix(arr.size());
       prefix[0]=arr[0];
       for(int i=1;i<arr.size();i++)
       {
           prefix[i]=prefix[i-1]+arr[i];
       }
       for(int i=0;i<arr.size();i++)
       {
           if(2*prefix[i]==prefix[arr.size()-1])
           {
               return true;
           }
       }
       return false;
    }
};