PHP Program for Number of pairs with maximum sum

<?php
// PHP program to count pairs
// with maximum sum.

// function to find the number
// of maximum pair sum
function sum( $a, $n)
{
    
    // traverse through all
    // the pairs
    $maxSum = PHP_INT_MIN;
    for($i = 0; $i < $n; $i++)
        for($j = $i + 1; $j < $n; $j++)
            $maxSum = max($maxSum, $a[$i] + $a[$j]);

    // traverse through all 
    // pairs and keep a count
    // of the number of 
    // maximum pairs
    $c = 0;
    for($i = 0; $i < $n; $i++)
        for($j = $i + 1; $j < $n; $j++)
            if ($a[$i] + $a[$j] == $maxSum)
                $c++;
    return $c;
}

    // Driver Code
    $array = array(1, 1, 1, 2, 2, 2);
    $n = count($array);
    echo sum($array, $n);
    
// This code is contributed by anuj_67.
?>

<?php
// PHP program to count
// pairs with maximum sum.

// function to find the number
// of maximum pair sums
function sum( $a, $n)
{
    // Find maximum and second 
    // maximum elements. Also 
    // find their counts.
    $maxVal = $a[0]; $maxCount = 1;
    $secondMax = PHP_INT_MIN; 
    $secondMaxCount;
    for ( $i = 1; $i < $n; $i++) 
    {
        if ($a[$i] == $maxVal)
            $maxCount++;
        else if ($a[$i] > $maxVal) 
        {
            $secondMax = $maxVal;
            $secondMaxCount = $maxCount;
            $maxVal = $a[$i];
            $maxCount = 1;
        }
        else if ($a[$i] == $secondMax)
        {
            $secondMax = $a[$i];
            $secondMaxCount++;
        }
        else if ($a[$i] > $secondMax) 
        {
            $secondMax = $a[$i];
            $secondMaxCount = 1;
        }
    }

    // If maximum element appears
    // more than once.
    if ($maxCount > 1)
        return $maxCount * 
            ($maxCount - 1) / 2;

    // If maximum element 
    // appears only once.
    return $secondMaxCount;
}

// Driver Code
$array = array(1, 1, 1, 2,
                2, 2, 3 );
$n = count($array);
echo sum($array, $n);

// This code is contributed by anuj_67.
?>