Volume 65 | Issue 12 | Year 2019 | Article Id. IJMTT-V65I12P516 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I12P516
A new modified linear search technique is proposed for the search of an element from an unsorted array elementsto refine search techniques of unsorted array elements such as linear search technique and two way linear search technique. Algorithm and efficiency analysis of the proposed search technique is given. A comparison with linear search technique and two-way linear search technique is also given.
[1] D. Knuth ’The Art of Computer Programming Sorting and Searching’, Addison- Wesley 3 (1998).
[2] A. Oommen and C. Pal Int. Jour. of Innov. Res. in Tech. 1 800-803 (2014).
[3] S. Korteweg and H. Nieuwenhuy¨zen The jour. of Forth Appl. and Res. 2 43-45 (1984).
[4] N. Arora, G. Bhasin and N. Sharma Int. Jour. of Comp. Appl. 107 (2014).
[5] S. Manchanda ’Ternary search algorithm: Improvement of Binary search’ Research- gate (2015).
[6] A. R. Chandha, R. Misal and T. Mokashi Int. Jour. of Appl. Inf. Syst. 7 37-40 (2014).
[7] A. Levitin ’Introduction to The Design and Analysis of Algorithms’ Pearson Educa- tion (2004).
Subir Saha, Mridul K. Bhaumik, Supratim Das, "A New Modified Linear Search Algorithm," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 12, pp. 148-152, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I12P516