8 au 10 mars 2017
Montréal, Canada
Sorting!
I love sorting. Who doesn't love sorting? Let's talk about sorting!
It's a classic interview question: how do you sort a list? How about in O(N log N) time? (And what does that mean?)
We'll do a quick tour of the fundamental sorting algorithms, like insertion sort, quick sort and merge sort, and also talk about some of the fancy new algorithms you might have heard about, like tim sort.
It's a classic interview question: how do you sort a list? How about in O(N log N) time? (And what does that mean?)
We'll do a quick tour of the fundamental sorting algorithms, like insertion sort, quick sort and merge sort, and also talk about some of the fancy new algorithms you might have heard about, like tim sort.
Christopher Swenson
Dr. Christopher Swenson is a software engineer, computer scientist, and occasional mathematician. Swenson has been involved in open source since before knowing what open source really was. Swenson likes sorting a lot, and maintains an open source high-performance C sorting library. Swenson has sold their labor to companies big and small, such as Simple, Google, and the US Government, and wrote a book on cryptography. Swenson is one of the organizers of PyDX. Swenson is a cupcake.
Montréal 2017 sponsored by
