Hello,

I'm trying to compute the frequency ordering of the letters appearing in the ciphertext, and guess a potential decryption key by mapping them to the standard English letter frequency ordering: ETAOINSHRDLCUMWFGYPBVKJXQZ. I'm doing this in C++ and I was thinking of just getting each character at a time and passing it thorugh a switch statement where a counter would get incremented for each letter. I just feel like there might be a more efficient way of counting the frequency of a letter. Is there? If there isn't it's okay I was just curious.

Also, how is a switch statement more efficient than an if statement? I'm a little foggy on that.