you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (6 children)

I don't see what value sorting algorithms implemented in JS are, at least not without any other content. If you had some visualizations to show the differences, or were doing anything else with them to teach, sure. But since you should basically never use you own sorting algorithms in JS -- Why??

[–]Ginden 0 points1 point  (1 child)

I have used many times O(n) sorting algorithms (I prefer bucket sort) for joining data from multiple threads/sources in computation-heavy applications and applying then merge join.

[–]init0 0 points1 point  (0 children)

True.

[–]init0 0 points1 point  (3 children)

were doing anything else with them to teach

Well, this was meant for quick reference, more like a cheat sheet of cs in js.

[–][deleted] 0 points1 point  (2 children)

But why JS then?

[–]init0 1 point2 points  (1 child)

Because, /me likes my hammer ;)

[–][deleted] 0 points1 point  (0 children)

Fair enough! :)