Help me develop and understand this flowchart please

[untold mango]

An array contains ASCII characters ('A'–'Z' and 'a'–'z') in its individual elements.
The array has the size MAX_FELD (MAX_FELD > 0).

The task is to find:

• the character with the largest value (according to the ASCII table), and
• the number of times this character appears in the array.

Develop a flowchart (PAP) in the form of a procedure to solve this problem.

[verbal dawn]

When your question is answered use !solved or the button below to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question use !howto ask.

[desert cairn]

int gettokenlength(char* buffer, int length) {
    
    int j = 0;
    for (int i = 0; i < length; i++) {
        if (((buffer[i] <= 'Z' && buffer[i] >= 'A') || (buffer[i] >= '0' && buffer[i] <= '9')) || (buffer[i] == '_' || buffer[i] == '-')) {
            j++;
        }
        else if(buffer[i] <= 'z' && buffer[i] >= 'a'){
            j++;
        } else {}
    }
    return j;

}

I wrote this idk if this can help u with ur goal

but basically everything in the ascii is incremental so u shouldn't be having a hard time with it I think

[lofty reef]

i mean, helping ppl with the logic is more efficient than giving only the solution

[desert cairn]

u might want to look at the ascii table character chart also

[desert cairn]

I gave him the code so that he can understand the logic

Ascii A + 1 = B

Ascii B + 2 = D

you d want to look at the highest character in the ascii table

but I'm not helping you to "blueprint" this into your head it's your share of work