EIMACS:
Today I worked through some more of the EIMACS curriculum. I learned about the merge sort algorithm, which I actually thought was pretty cool. It works by splitting the array in half, then splitting those halves in half and so on. It then merges each fragment back together, eventually sorting the array.
Web Design:
Helped fix the /~atic/ site when viewed on a mobile device by changing the mediaquery from max-width: 480px to max-device-width: 480px.
It's music to my ears that you "actually thought [it] was pretty cool". Indeed it is! This is an example of a very power problem solving strategy that works on a whole class of problems. It is know as a divide and conquer algorithm (see http://en.wikipedia.org/wiki/Divide_and_conquer_algorithms). Quick sort is even cooler, IMHO, but to see how it is helpful to grok merge sort first (my personal favorite is heap sort, which still lies ahead).
ReplyDelete