Klaipėdos universitetas logo


  • List of journals
  • About Publisher
  • Help
  • Sitemap
Login Register

  1. Home
  2. Journals
  3. csat
  4. Issues
  5. Volume 7 (2020)
  6. Efficiency Analysis of Binary Search and ...

Computational Science and Techniques

Submit your article Information
  • Article info
  • More
    Article info

Efficiency Analysis of Binary Search and Quadratic Search in Big and Small Data
Volume 7 (2020), pp. 605–615
Kevin Hendy   Wirawan Istiono  

Authors

 
Placeholder
https://doi.org/10.15181/csat.v7i1.2091
Pub. online: 16 July 2020      Type: Article      Open accessOpen Access

Received
19 June 2020
Accepted
30 June 2020
Published
16 July 2020

Abstract

When doing a searching process, Binary Search is one of the classic algorithm used in sorted data. The characteristic of this algorithm is to make a comparison of the keywords you want to find with the start, middle, and end values of a data series. Keyword search is done by reducing the range of start and end points to finally find the keyword you want to search. The time complexity of the binary search algorithm is O(log2n) while the memory capacity needed is O(1) for iterative implementation and O(log2n) for recursive implementation. This research will develop a level of comparison in binary search in order to get optimal performance in accordance with the amount of data available.

PDF XML
PDF XML

Copyright
No copyright data available.
by logo by logo
Creative Commons Attribution 3.0 License

Keywords
Binary Search Performance Analysis Binary Search Rankings

Metrics (since February 2021)
52

Article info
views

0

Full article
views

210

PDF
downloads

140

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

Powered by PubliMill  •  Privacy policy