A New Variant of Move-To-Front (SPIN-Move To Front) List Accessing Algorithm

Abstract

List Accessing Problem is a well studied research problem in the context of linear search. There are many existing algorithms are available for list accessing problem. Move-To-Front (MTF), Transpose (TRANS), and Frequency Count (FC) are the three primitive and widely used list accessing algorithms. All other list accessing algorithms are the variants of these three algorithms. In this paper we have made an experimental analysis of MTF and IMTF algorithms and develop “A new variant of MTF (SPIN-MTF) list accessing algorithm”. The experimental analysis of the algorithm shows that SPIN-MTF is performing better than MTF and IMTF algorithm.