DocumentCode :
3258224
Title :
Bidirectional Square Root Search
Author :
Kazmi, Syed Zaki Hassan ; Kazmi, Syeda Shehla ; Kazmi, Syeda Sobia Hassan
Author_Institution :
Dept. of Comput. Sci., IQRA Univ., Islamabad, Pakistan
Volume :
2
fYear :
2010
fDate :
22-24 June 2010
Abstract :
The research in hand is an effort to introduce a new efficient searching technique known as Bidirectional Square Root Search, which is fastest then existing searching techniques including binary search in many cases. In this technique the number of element of the sorted list to be searched is reduced by exploring the list from both end simultaneously. Running Cost analysis and the result obtained after implementation are provided in the graphical form with an objective to compare the efficiency of the technique with binary search, as binary search is consider as an efficient and fast one.
Keywords :
computer science education; graph theory; search problems; bidirectional square root search; binary search; graphical form; running cost analysis; searching technique; Computer science; Computer science education; Costs; Educational technology; Humans; Jamming; Mathematics; Sorting; Testing; Binary Search; Linear Search; Searching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Education Technology and Computer (ICETC), 2010 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-6367-1
Type :
conf
DOI :
10.1109/ICETC.2010.5529320
Filename :
5529320
Link To Document :
بازگشت