source/algorithms/countingSort.c
int largest(int vector[], int vector_size)
{
    int result = vector[0];

    for(int i = 1; i < vector_size; i++)
    {
        if (vector[i] > result)
        {
            result = vector[i];
        }
    }

    return result;
}
//This function searches for the largest element of an input vector.

This function searches for the largest element of an input vector.
This function searches for the largest element of an input vector .
int largest(int vector[], int vector_size)
{
    int result = vector[0];
    for(int i = 1; i < vector_size; i++)
    {
        if (vector[i] > result)
        {
            result = vector[i];
        }
    }
    return result;
}
int largest ( int vector [ ] , int vector_size ) { int result = vector [ 0 ] ; for ( int i = 1 ; i < vector_size ; i ++ ) { if ( vector [ i ] > result ) { result = vector [ i ] ; } } return result ; }
This function searches for the largest element of an input vector.
This function searches for the largest element of an input vector .