Abstract
Employing an appropriate algorithm, hardware and technique makes operations easier and faster in today digital world. Searching data which is a fundamental operation in computer science is an important problem in different Areas. An efficient algorithm is useful to search a data element in huge amount of data while information is growing in every second. There are various papers on searching algorithms to find data elements whereas different types of query in different areas of works including position, rank, count and closest element exists. Each of these queries may be useful in different computations. This paper proposed two algorithms of these four types of query employing Centralized Diamond architecture which consume constant execution time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering & Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
