CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Tri-Search: A New and Efficient Searching Algorithm: An Extension of Ternary Search Approach with Variable Partitioning

by Hriday Kumar Gupta, Rajesh Pandey
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 181 - Number 8
Year of Publication: 2018
Authors: Hriday Kumar Gupta, Rajesh Pandey
10.5120/ijca2018917630

Hriday Kumar Gupta, Rajesh Pandey . Tri-Search: A New and Efficient Searching Algorithm: An Extension of Ternary Search Approach with Variable Partitioning. International Journal of Computer Applications. 181, 8 ( Aug 2018), 50-53. DOI=10.5120/ijca2018917630

@article{ 10.5120/ijca2018917630,
author = { Hriday Kumar Gupta, Rajesh Pandey },
title = { Tri-Search: A New and Efficient Searching Algorithm: An Extension of Ternary Search Approach with Variable Partitioning },
journal = { International Journal of Computer Applications },
issue_date = { Aug 2018 },
volume = { 181 },
number = { 8 },
month = { Aug },
year = { 2018 },
issn = { 0975-8887 },
pages = { 50-53 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume181/number8/29796-2018917630/ },
doi = { 10.5120/ijca2018917630 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:05:26.886029+05:30
%A Hriday Kumar Gupta
%A Rajesh Pandey
%T Tri-Search: A New and Efficient Searching Algorithm: An Extension of Ternary Search Approach with Variable Partitioning
%J International Journal of Computer Applications
%@ 0975-8887
%V 181
%N 8
%P 50-53
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Searching is a traversal technique in a data structure to search a particular element in a given set of particular domain. Sorting Technique is generally used in a huge variety of important applications to search a particular item. There are various Searching Algorithms for different data structure having different time and space complexity. This paper contributes an efficient searching algorithm Tri-Search search which is poisoned on dividing the given elements into three unequal parts. This paper also compare the Tri-Search search algorithm with Linear Search and Binary Search. Python is used for implementation and Analysis of CPU time taken for all the three searching algorithms used. Linear search can be used with any random array elements but for binary search and Tri-Search search element must be in sorted array. Result shows that Tri-Search search algorithm requires less time for search any particular element.

References
  1. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addiso Wesley,1973 Structures..
  2. Quadratic Research Paper International Journal of Computer Applications (975– 8887) Volume 65– No.14, March 2013
  3. Cormen T.H., Leiserson C.E., Rivest R.L. and Stein C.(2003) Introduction to Algorithms MIT Press, Cambridge, MA, 2nd edition.
  4. Knight, W.: Search in an ordered array having variable probe cost. SIAM J. Comput. 17(6), 1203–1214 (1988).
  5. D. Coppersmith, “Fast evaluation of logarithms in finite fields of characteristic two,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 587-594, 1984.
  6. Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM J. Comput. 28(6), 2090–2102 (199Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.: Searching in random partially ordered sets.Theor. Comput. Sci. 321(1), 41–57 (2004)
  7. Knight, W.: Search in an ordered array having variable probe cost. SIAM J. Comput. 17(6), 1203–1214 (1988)
  8. Navarro, G., Baeza-Yates, R., Barbosa, E., Ziviani, N., Cunto, W.: Binary searching with nonuniform costs and its application to text retrieval. Algorithmica 27(2), 145 169(2000)
  9. The -Version of Binary Search Trees: An Average Case Analysis, Hindawi Publishing CorporationISRN Combinatorics,Volume 2013, Article ID 450627, 8 pages,http://dx.doi.org/10.1155/2013/450627
  10. Machine Vision and Applications,DOI 10.1007/s00138- 013-0483-3A 3-degree of freedom binary search pose estimation technique,Robert Ross · Andrew Martchenko John Devlin,Received: 18 September 2011 / Revised: 29 October 2012 / Accepted: 11 january 2013,© Springer- Verlag Berlin Heidelberg 2013
  11. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-5, NO. 4, JULY 1979,Multidimensional Binary Search Trees in Database Applications,JON L. BENTLEY, MEMBER, IEEE
  12. Non-blocking Binary Search Trees, PODC’10, July 25– 28,2010, Zurich, Switzerland.Copyright 2010 ACM 978- 1-60558-888-9/10/07 ...$10.00.
  13. A Non-Blocking Internal Binary Search Tree,SPAA’12, June 25–27, 2012, Pittsburgh, Pennsylvania, USA.Copyright 2012 ACM 978-1-4503-1213-4/12/06
Index Terms

Computer Science
Information Sciences

Keywords

Binary Search Complexity algorithms data key. procedure.

Powered by PhDFocusTM