Bidirectional Square Root Search

摘要：

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.

关键词： Searching Linear Search Binary Search

作者: Syed Zaki Hassan Kazmi Syeda Shehla Kazmi Syeda Sobia Hassan Kazmi

作者单位: Department of Computer Science IQRA University H-9 Islamabad, Pakistan Department of Computing &Mathematics Manchester Metropolitan University, United Kingdom Department of Computer Science The University Of Azad Jammu And Kashmir Muzaffarabad A.K, Pakistan

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

会议地点: 上海

会议语种:英文

页码: 567-569

在线出版日期: 2010-06-22（万方平台首次上网日期，不代表论文的发表时间）