Re:Sorting a Billion Numbers with Julia
by dekhn on Monday March 21, 2016 @07:19PM
(#11333012)
Yes, they are being sarcastic. The list has to be fully materialized and iterated over. Further, the Haskell version probably doesn't have a concept of doing work in memory-sized batches with spill-to-disk, so the runtime would likely be much higher. Of course, I don't know enough Haskell so it's entirely possible they somehow figured this how to iterate over the input data in sorted order efficiently without materializing it.
[ Parent
| on HN ]
There are no comments on this comment yet.