3 ms·

Regarding maximum input size, I'm sure it can be forked to implement a tweet-sharding approach.

• jayp 12y ago
  Sharding via a Tweet Storm(TM).
• guelo 12y ago
  In the sorting world it's called a bucket, not a shard.
• wging 12y ago
  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.
  • emmanueloga_ 12y ago
    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_sort http://en.wikipedia.org/wiki/Merge_sort#Optimizing_merge_sor...