@bryan_hunter is the point of erlang quicksort v. mergesort exercise that erlang's just better at writing efficient algos than inefficient?
-
-
Replying to @knewter
@knewter Haha, that's a question for the author@FrancescoC, but my two cents is Erlang is ideal for use cases where Mergesort is best.2 replies 0 retweets 0 likes -
Replying to @bryan_hunter
@knewter@FrancescoC ...like big data sets that are too large for memory, and better yet too large for one machine. Distributed Mergesort!1 reply 0 retweets 0 likes -
Replying to @bryan_hunter
@bryan_hunter@FrancescoC yeah, so distributed merge sort is an awesome idea I'd not yet realized, but such an obvious good idea1 reply 0 retweets 0 likes
Replying to @knewter
@knewter @bryan_hunter Point is clarity and ease of maintenance, not speed. First make it work, then make it beautiful.
11:01 PM - 8 Sep 2013
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.