Author Login IJIRT Partner Network (IPN) Login

Quaternary Search

  • Unique Paper ID: 143908
  • Volume: 3
  • Issue: 4
  • PageNo: 17-22
  • Abstract:
  • 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.
email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 3
  • Issue: 4
  • PageNo: 17-22

Quaternary Search

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry