Just another Perl shrine | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
That's a pretty detailed explanation.
But am not very sure about the conclusion you have stated. Based on your comment, it seems sorting ( whatever be the size of the dataset ) is going to take much lesser time compared to other methods like DBM::Deep So, what exactly is the demarcating line between when to use 'sorting' and when to use DBM::Deep (for example)? Would you mind elaborating on that? Thanks In reply to Re^3: Memory Efficient Alternatives to Hash of Array
by matrixmadhan
|
|