Have you ever wondered how Array#sort works under the hood?
Setting aside its default, not well-known behavior of sorting elements lexicographically instead of numerically, there is actually so much more going on than meets the eye.
In this CS101 we’ll explore some useful sorting algorithms currently used by popular JS engines such as Chrome's V8 and Firefox's SpiderMonkey.
We'll demystify O(n) notation, talk about performance, and take a look at the JS implementations of said algorithms.
As a developer, learning how these algorithms work, why and when to use them will help you solve complex problems in your web applications. If you ever skipped this course at school (or never actually taken it), now's your chance to catch up and learn a thing or two !


Comments are closed.

Anonymous at 11:32 on 11 May 2017

An ok intro but overall nothing new or "exciting" in the talk. It's part of giving a cs 101 but I expected a deep dive on optimizations ie showing a slow algo in Js and then optimizing its big o. Also I would somehow suggest to explain big o a bit more, ie. Showing that it doesn't really matter on small numbers but as the input grows etc etc. And for example there was a missing part on why browsers use insertion sort for small lists with a theoretical explanation. But overall I think it was a nice talk regardless :)

Blake Newman at 11:47 on 11 May 2017

Great talk...

Talked fairly fast but was clear, slowing down may help some.

Maybe explaination on why best Vs worse case is happening. May have missed during code example, maybe switch code slide after so you can highlight the issues

Luca Maroni at 12:06 on 11 May 2017

This talk was good and very interesting, maybe a little too fast on the code part.
Still a good talk though, thanks!

Some introspection in optimizations for these algorithms (e.g. sorting numbers vs. strings) would have been better, but worth hearing anyway!

Technical and academic. And I loved it!
Examples and animations could've been better, though.

loved this talk. need more like that.

tore at 15:20 on 12 May 2017

I studied sorting algorithms at the university, but I think the explanation was so clear to be understandable also for a "novice".

Stefano Sala at 15:36 on 12 May 2017

More on O(n), less on actual sorting algorithm would have been more useful in real life, imo :)
But well presented and interesting anyway

Andy Johnson at 21:59 on 12 May 2017

Probably the talk required more time, well presented but I didn't get the point

Enrico Bono at 00:03 on 14 May 2017

Amazing talk, straight to the point, with full examples. Thanks and keep going, we do need to remember thing we would like to forget :D

A good talk. Well explained...