in reply to Re: Re (tilly) 1: Sorting data that don't fit in memory
in thread Sorting data that don't fit in memory

The underlying data structure is a B-tree
  • Comment on Re^2: Re (tilly) 1: Sorting data that don't fit in memory

In Section Seekers of Perl Wisdom