How to Select a Searching Algorithm-A Comparative Study
 |
International Journal of Computer Trends and Technology (IJCTT) | 
|
| © 2017 by IJCTT Journal | ||
| Volume-48 Number-3 |
||
| Year of Publication : 2017 | ||
| Authors : Sobha Xavier P, Jisna V A, Bineesh M | ||
| DOI : 10.14445/22312803/IJCTT-V48P122 |
Sobha Xavier P, Jisna V A, Bineesh M "How to Select a Searching Algorithm-A Comparative Study". International Journal of Computer Trends and Technology (IJCTT) V48(3):108-111, June 2017. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract -
Searching is a process of checking whether the required item is available or present in a certain data set. Searching can done based on the key element. A number of searching algorithms have been developed like that sequential search, binary search, tree search and hashing etc.
References
[1] Classic Data Structures Samanta (Author), Debasis (Author).
[2] A Comparison and Selection on Basic Type of Searching Algorithm in Data Structure Kamlesh Kumar Pandey1, Narendra Pradhan2IJCSMC, Vol. 3, Issue. 7, July 2014
[3] Designing And Implementing Data Structure With Search Algorithm To Search Any Element From A Given List Having Constant Time Complexitydr. Vimal P. Parmar ,Dr. CK Kumbharana, E-ISSN No : 2454- 9916 Volume : 3 | Issue : 1 | Jan 2017ternIERJational Education & Research Journal [IERJ]
[4] Data Structures Using C ,Udit Agarwal
[5] http://www.geeksforgeeks.org/
[6] An Introduction to Data Structures with Application by Jean-paul Tremblay Tata McGraw Hill.
[7] Data Structures by Seymour Lipschutz and G A Vijayalakshmi Pai (Tata McGraw Hill companies), Indian
adapted edition-2006,7 west patel nagar, New Delhi-110063.
Keywords
Linear search , Binary search, pseudo code, Hashing, Collission, Probing.