Next: Linear Search : the Transpose
Previous: Lookup by Binary Search
Here the transitions are kept unordered and looking up takes linear time. To
speed up the process, once found, the wanted transition is placed at the
beginning of the array and the others are shifted back so that after a number
of access, the most popular transitions find themselves up-front.