Abstract: A searching algorithm was found to be effective in producing acutely needed results in the operation of data structures. Searching is being performed as a common operation unlike other operations in various formats of algorithms. The binary and linear search book a room in most of the searching techniques. Going with each technique has its inbuilt limitations and explorations. The versatile approach of different techniques which is in practice helps in bringing out the hybrid search techniques around it. For any tree representation, the sorted order is expected to achieve the best performance. This paper exhibits the new technique named the biform tree approach for producing the sorted order of elements and to perform efficient searching.

Celine , Shinoj Robert and Maria Dominic, “A Succinct Novel Searching Algorithm” International Journal of Advanced Computer Science and Applications(IJACSA), 12(5), 2021. http://dx.doi.org/10.14569/IJACSA.2021.0120577

@article{2021,
title = {A Succinct Novel Searching Algorithm},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2021.0120577},
url = {http://dx.doi.org/10.14569/IJACSA.2021.0120577},
year = {2021},
publisher = {The Science and Information Organization},
volume = {12},
number = {5},
author = {Celine and Shinoj Robert and Maria Dominic}
}