Like I said I would yesterday, I have completed my conglomeration of two Unix/Vim command cheat sheets that I came across in my travels around the internet (or grape-net, if Justin is to be believed), along with some commands I know and use often that weren’t on the sheets. This hasn’t been spelling- or error-checked much at all, so I dunno….if you happen to take it and use it for yourself…you might, like, tell me if there are any errors that you find…probably? That would be nice of you, if you, the reader, were to use this in such a way. Anyway, here it is…(click the image for the fullsize 1440×900 version)
I tried to include as much as I could think of and fit into the frame – but surprisingly, I have space left over. I may add to it as I come across more useful stuff. But for now, enjoy if you care to do so.
I saw the Upright Citizens again last night. The line was huge because there were rumors that Amy Poehler was going to be involved, but unfortunately she was not. Still it was a sweet show. I also ate some pizza, skateboarded around a little bit in the snow – it was very good. I feel like I’ve been ending a lot of my posts recently by saying that I’m going to go play video games, but that’s actually kind of a rare thing for me these days. I’m being too productive – I gotta get my head in the game. Portal 2 is coming out soon, and I must prepare.
I just spent a good little bit of time figuring out and writing the basic binary search algorithm in perl. It took me a bit longer than I think it maybe “should have”, but it works now. I’d heard binary search referenced in class, as well as seen it explained in the video lectures from MIT I’ve been watching. In case you don’t know, here’s a brief explanation.
Looking for ways to find a specific element in a presorted ascending list, the first thing you might think of would be to step through the list sequentially. When the element of the list you were currently looking at was greater than the one you’re trying to find, you’d know that the one you’re looking for isn’t there. Another way (binary search) which is a lot faster, is to first check which half (upper or lower) the element you’re looking for is in by finding the midpoint of the list and comparing it to the searched element. If it’s in the upper half, then find the midpoint of that half and do the comparison again. Essentially, you’re dividing the set in half with every time through the loop. Eventually, the top and bottom bounds of the piece you’re looking at will converge, and then you’ve found your element.
So anyway, I wrote that in perl today, which is a language that I’m not abundantly familiar with, using vim, which (apart from crontab) i had my first experience with today. So it took a little while. But I found two great vim/unix cheat sheets that I plan on combining later tonight and making into a sweet background for my external monitor. Learning accomplished. Now time for Chrono Trigger. Most triumphant.