Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Hussein Search Algorithm: A Novel Efficient Searching Algorithm in Constant Time Complexity

Author 1: Omer H Abu El Haijia Author 2: Arwa H. F. Zabian
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 14, No. 8 · Published 2023

DOI: 10.14569/IJACSA.2023.0140833

Abstract

Hussein search algorithm focuses on the fundamental concept of searching in computer science and aims to enhance the retrieval of data from various data warehouses. The efficiency of cloud systems is substantially influenced by the manner in which data is saved and retrieved, given the vast quantity of data being generated and stored in the cloud. The act of searching entails the systematic endeavor of locating a particular item within a substantial volume of data, and searching algorithms offer methodical strategies for accomplishing this task. There exists a wide array of searching algorithms, each exhibiting variations in terms of the search procedure, time complexity, and space complexity. The choice of the suitable algorithm is contingent upon various aspects, including the magnitude of the dataset, the distribution of the data, and the desired temporal and spatial intricacy. This study presents a novel prediction-based searching algorithm named the Hussein search algorithm. The system is designed to operate in a straightforward manner and makes use of a simple data structure. This study relies on fundamental mathematical computations and incorporates the interpolation search algorithm, an algorithm that introduces a search by-prediction method for uniformly distributed lists, it forecasts the precise position of the queried object. The cost of prediction remains consistent and, in numerous instances, falls under the O(1) range. Hussein search algorithm exhibits enhanced efficiency in comparison to the binary search and ternary search algorithms, both of which are widely regarded as the best methods for searching sorted data.

Keywords

How to Cite this Article

Haijia, O. H. A. E., & Zabian, A. H. F. (2023). Hussein Search Algorithm: A Novel Efficient Searching Algorithm in Constant Time Complexity. International Journal of Advanced Computer Science and Applications, 14(8). https://doi.org/10.14569/IJACSA.2023.0140833

Haijia, Omer H Abu El, and Arwa H. F. Zabian. "Hussein Search Algorithm: A Novel Efficient Searching Algorithm in Constant Time Complexity." International Journal of Advanced Computer Science and Applications, vol. 14, no. 8, 2023, https://doi.org/10.14569/IJACSA.2023.0140833.

@article{Haijia2023,
  title     = {Hussein Search Algorithm: A Novel Efficient Searching Algorithm in Constant Time Complexity},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {8},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Omer H Abu El Haijia and Arwa H. F. Zabian},
  doi       = {10.14569/IJACSA.2023.0140833},
  url       = {https://doi.org/10.14569/IJACSA.2023.0140833}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.

Call for Papers - Important Dates

Volume 17 No. 11, November 2026
Paper Submission Due October 25, 2026
Review Notification November 15, 2026
Publication Date November 30, 2026