Efficiency Analysis of Binary Search and Quadratic Search in Big and Small Data
<p>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 ra...
Main Authors: | Kevin Hendy, Wirawan Istiono |
---|---|
Format: | Article |
Language: | English |
Published: |
Klaipėda University
2020-01-01
|
Series: | Computational Science and Techniques |
Online Access: | http://journals.ku.lt/index.php/CST/article/view/2091 |
Similar Items
-
Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey
by: Yuan Cao, et al.
Published: (2018-01-01) -
Norm-Based Binary Search Trees for Speeding Up KNN Big Data Classification
by: Ahmad B. A. Hassanat
Published: (2018-10-01) -
Interpolated binary search: An efficient hybrid search algorithm on ordered datasets
by: Adnan Saher Mohammed, et al.
Published: (2021-10-01) -
Two-point-based binary search trees for accelerating big data classification using KNN.
by: Ahmad B A Hassanat
Published: (2018-01-01) -
Small solutions of quadratic congruences, and character sums with binary quadratic forms
by: Heath-Brown, R
Published: (2016)