#pset2

I must have been working on Vigenere for a week and a half, off and on.  I finally got it this evening.  I was so close for so long, and I had this idea in my mind about what the code should be like.  But, that’s the funny thing about this course... pretty much every time, the solution I come up with is on a whim and is nothing like what I originally envision.  Plus, it’s a more elegant solution (I think, at least!).  

At last -- the final problem in pset2 in CS50. This one really kicked me up and down the block. It was this requirement that made it so hard for me:

if your code is about to apply the jth character of k to the ith character of p, but the latter proves to be a non-alphabetical character, you must wait to apply that jth character of k to the next alphabetical character in p; you must not yet advance to the next character in k.

I'm very glad to have that one solved!