C++ Branchless Sum Array

//Normal
int sum1(int arr[], int n)
{
    int sum = 0;

    for (int i = 0; i < n; i++)
    {
        sum += arr[i];
    }

    return sum;
}

//Branchless
int sum2(int arr[], int n)
{
    int sum = 0;
    int *p = arr;

    int *end = arr + n;

    while (p != end)
    {
        sum += *p++;
    }

    return sum;
}