Next: Representing the subsets I,
Previous: Linear Search : the Move-To-Front
Here the heuristic is slightly different from the Move-To-Front method : once
found, the transition is swapped with the immediately preceding one,
performing an incremental bubble sort at each access.
Of course, these two techniques provide a sensitive speed-up only if the
probabilities for each transition to be accessed are not uniform.
These are the seven representations that caught our attention at first but that
set of containers will be broadened when a special need is to be satisfied.
What is obvious here is that each of these structures has advantages and
drawbacks, whether on space complexity or on time complexity. All these
constraints have to be taken in account in order to construct code adapted to