Recursion: Largest pairs num

int largest_digit_pairs(int n)
{
    int myLargestPair, hisLargestPair;
    int remainingNumber;

    if(n == 0)
        return 0;

    myLargestPair = n % 100;
    remainingNumber = n / 100;
    hisLargestPair = largest_digit_pairs(remainingNumber);

    return myLargestPair >= hisLargestPair ?  myLargestPair : hisLargestPair;
}