The number that has the maximum number of divisors inside an array

int findNumWithMaxDivisors(int arr[], int size) {
    int maxCount = 0;
    int maxNum = -1;
    for(int i = 0; i < size; i++) {
        int count = 0;
        for(int j = 1; j <= arr[i]; j++) {
            if(arr[i] % j == 0) {
                count++;
            }
        }
        if(count > maxCount) {
            maxCount = count;
            maxNum = arr[i];
        }
    }
    return maxNum;
}