CS101: intro to computational complexity: the Sorting Problem

Claudia Hernández (11.May.2017 at 11:00, 25 min)
Talk at jsDay 2017 (English - UK)

Rating: 4 of 5

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 !

Who are you?

Claim talk

Talk claims have been moved to the new Joind.in site.

Please login to the new site to claim your talk

Want to comment on this talk? Log in or create a new account or comment anonymously

Write a comment

 
Please note: you are not logged in and will be posting anonymously!
= eight minus two

Comments

Rating: 3 of 5

11.May.2017 at 11:32 by _odino_ (7 comments) via Web2 LIVE

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 :)

Rating: 5 of 5

11.May.2017 at 11:47 by Blake Newman (3 comments) via Web2 LIVE

Great talk...

Advice:
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

Rating: 4 of 5

11.May.2017 at 12:06 by Luca Maroni (17 comments) via Web2 LIVE

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

Rating: 3 of 5

11.May.2017 at 12:35 by Mattia Gentilini (13 comments) via Web2 LIVE

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

Rating: 4 of 5

11.May.2017 at 19:28 by Massimo Artizzu (35 comments) via Web2 LIVE

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

Rating: 5 of 5

11.May.2017 at 20:52 by Giorgio Beggiora (56 comments) via Web2 LIVE

loved this talk. need more like that.

Rating: 4 of 5

12.May.2017 at 15:20 by tore (7 comments) via Web2 LIVE

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

Rating: 3 of 5

12.May.2017 at 15:36 by Stefano Sala (21 comments) via Web2 LIVE

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

Rating: 3 of 5

12.May.2017 at 21:59 by Andy Johnson (16 comments) via Web2 LIVE

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

Rating: 5 of 5

14.May.2017 at 00:03 by Enrico Bono (15 comments) via Web2 LIVE

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

Rating: 4 of 5

15.May.2017 at 11:42 by Davide Brognoli (14 comments) via Web2 LIVE

A good talk. Well explained...

© Joind.in 2017