Multi-Tier Search-A Novel Way of Searching 4D Array


Authors : Himani Tyagi, Puneet Bhardwaj.

Volume/Issue : Volume 3 - 2018, Issue 8 - August

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://goo.gl/a1BXTG

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

The linear search is the basic searching algorithm to search an item among the set of different items. Second basic algorithm is binary search that performs better than linear search. both are unstable sorting algorithms. Today many searching algorithm are present that are very fast to search an item. In this paper, a new approach for searching an item is presented. The comparison of proposed algorithm with Linear, Binary is also shown. The use of C++ for the implementation of this algorithm and analysis of CPU time taken by both is also preferred. Results have shown that proposed algorithm is working well for all the input values and it takes lesser time than sequential, binary searching in all aspects.

Keywords : Binary search, Linear Search, Layer Search, Searching techniques, Time Complexity, unstable searching algorithm.

CALL FOR PAPERS


Paper Submission Last Date
31 - August - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe