Merge sort is a sorting algorithm with a simple strategy: divide and conquer. Here’s a quick tutorial with examples of how to implement top-down and bottom-up methods in Swift.
A new day, a new algorithm. Today I’d like to go over binary search, or divide and conquer.
I’ve always been fascinated by algorithms. Much of what makes software engineering challenging is finding the right way to do something. When processing large amounts of data, finding the right algorithm can make the difference between accomplishing a task or failing entirely.
I suppose it is tempting, if the only tool you have is a hammer, to treat everything as if it were a nail.
It looks like Back to the Future was wrong: 2015 was not the year of the hover board.
For Memorial Day weekend, my girlfriend and I traveled down to North Carolina to visit family. On the way, we decided to book a hotel with the Hotels.com app. Using it brought up an interesting point: the most important part about creating software is the user experience.
Just recently there was an article posted to Hacker News titled Git in six hundred words, which went over the basics of git. If you’re relatively new to git, it’s definitely worth a read.
I think software development is something you need to approach like building a house.
I’m a big fan of John Gruber’s Daring Fireball, a blog that makes great use of linked posts. If you’re interested in configuring Jekyll as a linklog, here’s how.
It is important that we know where we come from, because if you do not know where you come from, then you don’t know where you are, and if you don’t know where you are, you don’t know where you’re going. And if you don’t know where you’re going, you’re probably going wrong.