Octonary (O) Search Algorithm

Authors

  • Maheshwari BR DNV International Education Academy, Gandhidham-Kachchh, Gujarat, India

DOI:

https://doi.org/10.26438/ijcse/v7i7.252256

Keywords:

Search Algorithm, Searching

Abstract

Searching is the process of finding a given value position in a list of values. It is fundamental operation in computer science. It is achieved by different searching methods which require number of iterations to reach at desired piece of data. In this research paper, another octonary (o) search algorithm is developed to compare & make searching even faster than algorithms like sequential, binary, ternary, & quaternary search.

References

[1] D Samanta, Classic Data Structure(2nd Edition), PHI Learning Private Limited ISBN - 10: 9788120337312 PP. 722-724

[2] Taranjit Khokhar, September 2016, IJIRT, Volume-3, Issue-4, PP.143908. ISSN: 2349-6002.

Downloads

Published

2019-07-31
CITATION
DOI: 10.26438/ijcse/v7i7.252256
Published: 2019-07-31

How to Cite

[1]
B. R. Maheshwari, “Octonary (O) Search Algorithm”, Int. J. Comp. Sci. Eng., vol. 7, no. 7, pp. 252–256, Jul. 2019.

Issue

Vol. 7 No. 7 (2019): IJCSE July Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.