That's not how you pack it! Understanding sorts.

William Springer


4:00 - 4:45

Why handle sorting yourself when your language or framework will do it for you? In most cases, the automatically-provided sort will work just fine, but metadata about the input may allow for a significant performance improvement.

In this talk, we’ll cover big-O notation (for those who either don’t have a computer science degree or have simply forgotten this part) and then move on to analyzing the asymptotic runtime of various sorting algorithms. We’ll see why mergesort works just fine the majority of the time, but how we can sometimes use a non-comparison sort to greatly boost performance.

No particular background is required.