A novel hybrid approach to list accessing problem using BIT algorithm

List accessing problem is associated with the searching and sorting of unordered records arranged linearly. Many approaches are followed and invented since more than four decades such as self-organizing linear lists in order to obtain a minimal cost for accessing the list. This paper introduces a hybrid method that is the combination of Move to Front (MTF) and transposes (TRANS) methods for the list accessing problem which results in a minimum of total access costs as compared to the cost of accessing of list using individual methods. Our paper also uses the randomized bit algorithm and look ashead concepts for obtaining the self-organizing linear list.