linked list
2 articles · search the full text for this term
-
An Auxiliary Array Indexing Approach for Efficient Binary Search in Linked Lists
Abstract: The paper covers an algorithm for searching a linked list structure using binary search. Binary search is a classic example of an algorithm that follows the divide-and-conquer approach. Binary search may be used to find elements in an array. Trying to apply the conventional binary search to a linked list simply does not work out very well; it still has an O(n) time complexity, the same as linear search. This …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 21–28 Read article
-
Off-Line List Accessing Algorithms with Circular Doubly Linked List and Partial Cost Model
Abstract: List Accessing Problem (LAP) has been an interesting and challenging research area for computer scientists since last four decades. Various algorithms have been developed to access the records by different researchers with an intention to minimize the cost of traversal. This paper describes two newly proposed algorithms, which are variants of FC and MTF for circular doubly linked list with the use of partial cost model. A theoretical as well …
Published in Current Trends in Information Technology · Vol. 1, Issue 1, 2011 · pp. 16–22 Read article