Empirical Analysis of Quaternary and Binary Search

Clicks: 2
ID: 313059
2024
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #332 of 705 articles by views in Journal of Computing & Biomedical Informatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 705 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
This paper presents an empirical analysis between traditional binary search and quaternary search algorithm in sorted arrays. Binary search algorithm divides the list into two equal halves each time, whereas quaternary search technique divides it into four segments each time. An experiment was conducted with an objective to search the element which is causing the worst time complexity in case of sorted array. It was observed through experiment results that iterative binary search is better than recursive binary search, iterative quaternary search is better than recursive quaternary search and definitely iterative quaternary search is better than iterative binary search. So, the evaluation results prove the best time complexity of binary search algorithm is O(log2 n) and quaternary search algorithm has the best time complexity of O(log4n) and therefore, it’s decided that quaternary search algorithm is better in searching as compared to binary search algorithm.
Reference Key
imported_1777058751_69ebc3bfcf18e Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Abdul Waheed
Journal Journal of Computing & Biomedical Informatics
Year 2024
DOI
DOI not found
URL
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.