[Redacted] Academy – Week Two

I’ve finished week two and to say that I am tired is a complete understatement!

Have you ever been so mentally exhausted that you become physically exhausted? That’s how I feel every-single-day but It’s amazing, it’s fun, and it’s humbling.

Week two was a LOT better than week one. I still have those feelings of being the dumb kid in class and sometimes I feel like i’ll never learn this shit but at least I am not on the verge of tears anymore. . . I don’t know if it’s because of the support from my fellow coders or if I really am retaining some of this stuff? It’s probably a bit of both and either way, i’ll take it!

Also, the instructors have really stepped up and have been taking some extra time during the lectures to teach to us visual learners which has been super helpful.

I am a very right brained individual and learning to code is difficult for me, breaking the steps down is hard, and a lot of times I’ll think I have started at step one and it’s really step three, so i’ve been playing some logical thinking games for kids so I can get some muscle over on the left side. . . Hopefully.


The first few weeks were so hard that I spent a lot of time doubting myself and when you see what seems like the entire class flying through the lessons while you sit there and pull your hair out, it’s hard not to. I know that everyone will have their own “pull your hair out day”  but man, why did mine have to happen so soon?

This week though – we’ve played with regular expressions, Markov Chains, and Recursion

Regular Expressions — Don’t let the title fool you. . . If you’re into hieroglyphics you will love regular expressions – if not, then you may just end up with a headache. It turns out that I just might be into hieroglyphics because I quite enjoy Regex and this love came as somewhat of a surprise to me since i’ve really been struggling with the easy stuff.

Screen Shot 2014-02-17 at 7.37.07 PM

Markov Chains — My Markov chains need a bit of work – How do I explain Markov chains? I hardly understand them myself but here goes.

“A Markov analysis looks at a sequence of events, and analyzes the tendency of one event to be followed by another. Using this analysis, you can generate a new sequence of random but related events, which will look similar to the original.”

The Story: You’re in a new grocery store and you don’t know the aisle layout yet. You may end up in the produce section or maybe the milk aisle but it’s hard to say where you will end up next. . . It’s completely random and because you don’t know the layout yet you’re not really comfortable jumping a bunch of aisles at a time (I mean what if you forget the toilet paper?) so you try to stick to aisles nearby. If you were to play connect the dots of your grocery store adventure it might look like a ‘chain of events’.

Now imagine another person comes into the grocery store, the steps they take can be completely different but it would still look like a chain. That’s Markov. . . I think. . . Don’t hold me to that — Actually, feel free to correct me in the comments section if I am way off.


Recursion is when a function makes call to itself. Typically, a recursive function will have a terminating condition and one or more recursive calls to itself but instead of boring you with another long winded explanation i’ll just leave you with my little recursive pony.


I’ve had a LOT of people ask me about [Redacted] and while I am loving it so far – I can’t give anyone a full recommendation just yet. I guess my advice is just to follow my blog posts and hopefully i’ll have more time during the week to blog a bit more because I know there is some stuff I am missing from last week that I should talk about but my brain is so full of code that I can’t remember.