文章基本信息

标题：Linear Search Versus Binary Search: A Statistical Comparison for Binomial Inputs
本地全文：下载
作者：Anchala Kumari ; Rama Tripathi ; Mita Pal 等
期刊名称：International Journal of Computer Science, Engineering and Applications (IJCSEA)
印刷版ISSN：2231-0088
电子版ISSN：2230-9616
出版年度：2012
卷号：2
期号：2
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：For certain algorithms such as sorting and searching, the parameters of the input probability distribution, in addition to the size of the input, have been found to influence the complexity of the underlying algorithm. The present paper makes a statistical comparative study on parameterized complexity between linear and binary search algorithms for binomial inputs.
关键词：Linear search; binary search; parameterized complexity; statistics; factorial experiments