working through mit intro to algorithms, first with insertion sort
adding a readme dangit
adding a test for first example
adding some more tests for insertion sort to compare performance given inputs of varying sizes
futzing mostly
renaming now that I am going to be adding merge sort
working through merge sort
adding a benching script to compare sort algorithms
futzing around with C and Ruby implementations
testing in Ruby the more right-er way
Add 'PracticingAlgorithms/' from commit '0b723f2ae0a20ab8c90c33db8c1d9d9acd76a86f'

git-subtree-dir: PracticingAlgorithms
git-subtree-mainline: 0a9428093ce0fdea72ed2cfc1050521aba018c87
git-subtree-split: 0b723f2ae0a20ab8c90c33db8c1d9d9acd76a86f