The week's pick
Reseach Article
A Novel Ternary Search Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 144 - Number 11 |
| Year of Publication: 2016 |
| Authors: Nitin Arora, Mamta Martolia Arora, Esha Arora |
10.5120/ijca2016910387
|
Nitin Arora, Mamta Martolia Arora, Esha Arora . A Novel Ternary Search Algorithm. International Journal of Computer Applications. 144, 11 ( Jun 2016), 35-36. DOI=10.5120/ijca2016910387
Abstract
Searching is an algorithm that search a particular element in a given list of elements. Sorting Technique is frequently used in a large variety of important applications to search a particular element. Several Searching Algorithms of different time and space complexity are exist and used. This paper provides a novel searching algorithm Ternary search which is based on dividing the given elements into three parts. We also compare the Ternary search algorithm with Linear Search and Binary Search. MATLAB 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 but for binary search and ternary search sorted array is required. Result shows that ternary search algorithm requires less time for search any particular element.
References
- Arora, N., Tamta, V., and Kumar S. 2012. A Novel Sorting Algorithm and Comparison with Bubble Sort and Selection Sort. International Journal of Computer Applications. Vol 45. No 1. 31-32
- Herbert Schildt Tata McGraw-Hill , “The Complete Reference C fourth Edition”
- Alfred V., Aho J., Horroroft, Jeffrey D.U.(2002) Data Structures and Algorithms.
- Frank M.C. (2004) Data Abstraction and Problem Solving with C++. US: Pearson Education, Inc
- Cormen T.H., Leiserson C.E., Rivest R.L. and Stein C.(2003) Introduction to Algorithms MIT Press, Cambridge, MA, 2nd edition
- Seymour Lipschutz (2009) Data Structure with C, Schaum Series, Tata McGraw-Hill Education.
Index Terms
Keywords