03. Visteon Visteon Vertical histogram (A)

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;


void verticalHistogram(int* a, int arraySize)
{
    int arr[10] = {};
    int maxNum = 0;
    for (int i = 0; i < arraySize; i++)
    {
        arr[a[i]]++;
        if (arr[a[i]] > maxNum)
            maxNum = arr[a[i]];
    }

    /*

    for (int i = 0; i < 10; i++)
    {
        cout << arr[i] << endl;
    }
    */
    for (int i = maxNum; i > 0; i--)
    {
        for (int j = 0; j < 10; j++)
        {
            if (arr[j] == i)
            {
                arr[j]--;
                cout << '*';
            }
            else
            {
                cout << ' ';

            }
        }
        cout << endl;
    }

}

int main()
{
    int arr[] = { 1,7,2,9,6,7,1,3,7,5,7,9 };
    int arrSize = sizeof(arr) / sizeof(arr[0]);
    verticalHistogram(arr, arrSize);

}