News for hackers. Stuff that matters.

A comment on Sorting 1 million 8-digit decimal numbers in 1MB of RAM . Parent comment

Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by StavrosK on Sunday October 21, 2012 @12:36PM (#4680004)
Go ahead.
[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by Cieplak on Sunday October 21, 2012 @12:42PM (#4680017)
I'm am guessing it would take substantially more LOC to do this in Haskell than in Java. The problem seems to lend itself much better to OO design patterns than to functional ones.

edit: unless perhaps you make use of haskell's FFI, then maybe haskell could beat it on LOC

[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by ben0x539 on Sunday October 21, 2012 @04:07PM (#4680623)
I really don't see how OO design patterns come into play here. I haven't seen anyone suggest OO-based solutions.
[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by Cieplak on Sunday October 21, 2012 @04:34PM (#4680724)
The POC code offered by Renat Gilmanov is OO.
[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by mfukar on Monday October 22, 2012 @10:48AM (#4683365)
That's not a solution.
[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by taf2 on Sunday October 21, 2012 @01:49PM (#4680235)
i don't think you can run a JVM in less than 1MB of ram?
[ Parent | on HN ]
Re:Sorting 1 million 8-digit decimal numbers in 1MB of RAM by Cieplak on Sunday October 21, 2012 @02:14PM (#4680323)
True. The problem states, though, that the code can be placed in ROM. I agree that this isn't realistic for a JVM.
[ Parent | on HN ]