#include <iostream>

using namespace std;

template <typename T>
T maxn(T vekt[], T size)
{
    T tempBig = vekt[0]; // currently biggest number

    for(int i = 0;i < size; i++)
    {

        if(vekt > tempBig)
        {

            tempBig = vekt;
        }
    }

    return tempBig;
}

template <> char* maxn(char vekt[], int size)
{
    int theLongest = strlen(vekt[0]); // the longest string
    int i = 0;

    while(i < ant)
    {
        i++;
        if(theLongest > strlen(vekt)
        {
            theLongest = strlen(vekt);
        }
    }

    return &theLongest; // returning the adress to the longest
}


int main()
{
    char *CharPtrVektor[5] = {"A", "AB", "ABC", "ABCD", "ABCDE"};
    int IntVektor[6] = {1, 2, 3, 4, 5, 6};
    double DoubleVektor[5] = {1.1, 2.2, 3.3, 4.4, 5.5};

    double arf = 5;
    int barf = 6;
    int sarf = 5;

    cout << maxn(DoubleVektor, arf) << endl;    // testing the functions
    cout << maxn(IntVektor, barf) << endl;
    cout << maxn(CharPtrVektor, sarf) << endl;

    return 0;
}