benchmark_merge-sortDownload Abstract: Merge sort is often considered one of the most universally effective traditional sorting algorithms due to its consistency. It utilizes a divide and conquer algorithmic approach to break a large array down into smaller and smaller sub-components until only a couple of values are being compared, and then the sub-arrays are then merged … Continue reading A Benchmark Analysis Of Merge Sort →

I've attached my first "functional" resume here. The work experience is incomplete because it is currently waiting for pre-publication review. Points of emphasis: I have a bachelor's degree in computer science, as well as experience programming in a few languages I was a signals analyst by trade in the U.S. Navy but cross-trained in software … Continue reading My First “Functional” Software Dev Resume →

Thanks for joining me! Good company in a journey makes the way seem shorter. — Izaak Walton