note
salva
If you data does not fit in the available memory you will have to use an algorithm that does not require random access to the data.
<p>In practice that means you have to use one of the following alternatives:
<ul>
<li>Compacting/compressing your data in some way so that it fits in the available RAM
<li>Sorting the data and then processing it sequentially.
<li>Using a multi-pass approach. The data is divided in ranges that fit on the available memory and then, you process *all* the data repeatly but only considering the data in one range every time.</ul>
1030423
1030423