Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm

Abstract

Our new algorithm and data structure, pyramid search (PS) and skip ring, were created with the help of circular linked list and skip list algorithms and data structures. In circular linked list, operations were performed on a single circular list. Our new data structure consists of circular linked lists formed in layers which were linked in a pyramid way. Time complexity of searching, insertion and deletion algorithms equal to [Formula: see text] (lg[Formula: see text]) in an [Formula: see text]-element skip ring data structure. Therefore, skip ring data structure is employed more effectively ([Formula: see text](lg[Formula: see text])) in circumstances where circular linked lists ([Formula: see text]) are used. The priority is determined based on the searching frequency in PS which was developed in this study. Thus, the time complexity of searching is almost [Formula: see text](1) for [Formula: see text] records data set. In this paper, the applications of searching algorithms like linear search (LS), binary search (BS) and PS were realized and the obtained results were compared. The obtained results demonstrated that the PS algorithm is superior to the BS algorithm.