Open Access   Article Go Back

Octonary (O) Search Algorithm

Bhavesh R Maheshwari1

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-7 , Page no. 252-256, Jul-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i7.252256

Online published on Jul 31, 2019

Copyright © Bhavesh R Maheshwari . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

IEEE Style Citation: Bhavesh R Maheshwari, “Octonary (O) Search Algorithm,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.7, pp.252-256, 2019.

MLA Style Citation: Bhavesh R Maheshwari "Octonary (O) Search Algorithm." International Journal of Computer Sciences and Engineering 7.7 (2019): 252-256.

APA Style Citation: Bhavesh R Maheshwari, (2019). Octonary (O) Search Algorithm. International Journal of Computer Sciences and Engineering, 7(7), 252-256.

BibTex Style Citation:
@article{Maheshwari_2019,
author = {Bhavesh R Maheshwari},
title = {Octonary (O) Search Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {7 2019},
volume = {7},
Issue = {7},
month = {7},
year = {2019},
issn = {2347-2693},
pages = {252-256},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4754},
doi = {https://doi.org/10.26438/ijcse/v7i7.252256}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i7.252256}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4754
TI - Octonary (O) Search Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Bhavesh R Maheshwari
PY - 2019
DA - 2019/07/31
PB - IJCSE, Indore, INDIA
SP - 252-256
IS - 7
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
368 299 downloads 211 downloads
  
  
           

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.

Key-Words / Index Term

Search Algorithm, Searching

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.