Dev - C++ - En estadística la moda de un conjunto de valores es el valor que más frecuentemente ocurre o aparece

#include <iostream>

using namespace std;

int modaVector(int v[], int n);

int main()

{

    int v[] = {1, 2, 3, 4, 5, 5};

    int moda;

    moda = modaVector(v, 6);

    cout << "\nModa: ";

    moda == -1 ? cout << "Sin moda" : cout << moda;

    cout << endl;

    return 0;

}

int modaVector(int v[], int n)

{

    int moda, max = 0;

    int *ptr1 = v;

    for (int i = 0; i < n; i++)

    {

        int temp = 0;

        int *ptr2 = v;

        for (int j = 0; j < n; j++)

        {

            if (*ptr1 == *ptr2)

                temp++;

            ptr2++;

        }

        if (temp > max)

        {

            max = temp;

            moda = *ptr1;

        }

        ptr1++;

    }

    return max > 1 ? moda : -1;

}

#include <iostream>

using namespace std;

int modaVector(int v[], int n);

int main()

{

    int n;

    cout << "\nElementos: "; cin >> n;

    int v[n];

    for (int i = 0; i < n; i++)

    {

        cout << "(" << i+ 1 << "/" << n << "): ";

        cin >> v[i];

    }

    int moda;

    moda = modaVector(v, n);

    cout << "\nModa: ";

    moda == -1 ? cout << "Sin moda" : cout << moda;

    cout << endl;

    return 0;

}

int modaVector(int v[], int n)

{

    int moda, max = 0;

    int *ptr1 = v;

    for (int i = 0; i < n; i++)

    {

        int temp = 0;

        int *ptr2 = v;

        for (int j = 0; j < n; j++)

        {

            if (*ptr1 == *ptr2)

                temp++;

            ptr2++;

        }

        if (temp > max)

        {

            max = temp;

            moda = *ptr1;

        }

        ptr1++;

    }

    return max > 1 ? moda : -1;

}