In computer science, there are many ways to search the position of the required input value in an array. There are algorithms such as binary search and linear search. In this research paper, I will describe another new search algorithm which has been written to make the search even faster. This algorithm has been named as q (quaternary) search as it divides the array into four parts. After dividing the array, three elements are obtained which are compared to the specified input value. If the specified value matches any of the elements, the result is displayed. If not, then this process is repeated between any of the four parts of the array depending upon the specified value. This process is repeated until the result is found. There is also a disadvantage of this search algorithm as it requires the array to be sorted.
Article Details
Unique Paper ID: 143908
Publication Volume & Issue: Volume 3, Issue 4
Page(s): 17 - 22
Article Preview & Download
Share This Article
Join our RMS
Conference Alert
NCSEM 2024
National Conference on Sustainable Engineering and Management - 2024