Re:Twitter Sort
by Mahn on Tuesday January 13, 2015 @08:30PM
(#8883726)
Regarding maximum input size, I'm sure it can be forked to implement a tweet-sharding approach.
[ Parent
| on HN ]
Merging of tweet shards is also possible via the same mechanism. Just tweeterate through the retrieved shards and merge them one by one. To merge two lists, compare elements pairwise. To compare elements pairwise, construct a two element list and sort this list via the short-form tweetsort api.
Re:Twitter Sort
by emmanueloga_ on Wednesday January 14, 2015 @10:33PM
(#8890754)
For sorting big lists of numbers mergesort could be used, only resorting to twittersort when the list of numbers is small enough [1]. In fact, that's the way mergesort is generally implemented (except the "cutoff" algorithm is usually insertionsort, not tweetsort :p).
1: http://en.wikipedia.org/wiki/Merge_sort#Optimizing_merge_sor...
Sharding via a Tweet Storm(TM).