sec self-organizing lists searches are performed in other wordsif we had known the series of (at least nsearches in advance and had stored the records in order of frequency so as to minimize the total cost for these accessesthis cost would be at least half the cost required by the move-to-front heuristic (this will be proved using amortized analysis in section finallymove-to-front responds well to local changes in frequency of accessin that if record is frequently accessed for brief period of time it will be near the front of the list during that period of access move-to-front does poorly when the records are processed in sequential orderespecially if that sequential order is then repeated multiple times swap any record found with the record immediately preceding it in the list this heuristic is called transpose transpose is good for list implementations based on either linked lists or arrays frequently used records willover timemove to the front of the list records that were once frequently accessed but are no longer used will slowly drift toward the back thusit appears to have good properties with respect to changing frequency of access unfortunatelythere are some pathological sequences of access that can make transpose perform poorly consider the case where the last record of the list (call it xis accessed this record is then swapped with the next-to-last record (call it )making the last record if is now accessedit swaps with repeated series of accesses alternating between and will continually search to the end of the listbecause neither record will ever make progress toward the front howeversuch pathological cases are unusual in practice example assume that we have eight recordswith key values to hand that they are initially placed in alphabetical order nowconsider the result of applying the following access patternf if the list is organized by the count heuristicthe final list resulting from these accesses will be hand the total cost for the twelve accesses will be comparisons (assume that when record' frequency count goes upit moves forward in the list to become the last record with that value for its frequency count after the first two accessesf will be the first record and will be the second if the list is organized by the move-to-front heuristicthen the final list will be