How to find a frequent character in a string written in pseudocode. Thanks -


most frequent character design program prompts user enter string, , displays character appears in string.

it homework question, teacher wasn't helpful , driving me crazy can't figure out.

thank in advance.

this have far!

declare string str declare integer maxchar declare integer index  set maxchar = 0  display “enter want.” input str  index = 0 length(str) – 1     if str[index] = 

and im stuck. dont think right , dont know go it!

it seems me way want is: "go through every character in string , remember character we've seen times".

however, won't work. if remember count single character, "the character we've seen times 'a' 5 occurrences", can't know if perhaps character in 2nd place doesn't jump ahead.

so, have this:

  1. go through every character of string.
  2. for every character, increase occurrence count character. yes, have save count every single character encounter. simple variables string or int not going enough here.
  3. when you're done, you're left bunch of data looking "a"=5, "b"=2, "e"=7,... have go though , find highest number (i'm sure can find examples finding highest number in sequence), return letter corresponds to.

not complete answer, know, that's i'm going say.

if you're stuck, suggest getting pen , piece of paper , trying calculate manually. try think - how without computer? if answer "look , see", if text 10 pages? know can pretty confusing, point of used different way of thinking. if figure 1 out, next time easier because basic principles same.


Comments

Popular posts from this blog

ruby on rails - RuntimeError: Circular dependency detected while autoloading constant - ActiveAdmin.register Role -

c++ - OpenMP unpredictable overhead -

javascript - Wordpress slider, not displayed 100% width -