find_min()

int find_min(void)
{
    int min = max;
    for (int i = 0; i < candidate_count; i  )
    {
        if ((candidates[i].votes <= min) && ((candidates[i].eliminated) == false))
        {
             min = candidates[i].votes;
        }

    }
    return min;
}

is_tie()

bool is_tie(int min)
{
    // same no.of votes
    int sv = 0;
    for (int j = 0; j < candidate_count; j  )
    {
        if ((candidates[j].votes == min) && ((candidates[j].eliminated) == false))
        {
            sv  ;
        }
    }
    if ((sv > 1 ) && (!(min < max)) )
        return true;
    else
        return false;

}

Error(s) of find_min()

:( find_min returns minimum number of votes for candidate
    find_min did not identify correct minimum
:( find_min returns minimum when all candidates are tied
    find_min did not identify correct minimum
:( find_min ignores eliminated candidates
    find_min did not identify correct minimum

error is_tie()

:( is_tie returns false when only some of the candidates are tied
    is_tie did not return false