首页 | 本学科首页   官方微博 | 高级检索  
     


Expected complexity of fast search with uniformly distributed data
Authors:Gilbert N. Lewis  Nancy J. Boynton  F.Warren Burton
Affiliation:Department of Mathematical and Computer Sciences, Michigan Technological University, Houghton, MI 49931, U.S.A.;Department of Mathematical and Computer Sciences, Michigan Technological University, Houghton, MI 49931, U.S.A.;School of Computing Studies, University of East Anglia, Norwich NR4 7TJ, England
Abstract:
Keywords:Binary search  binomial distribution  complexity  data access  expected value  fast search  interpolation search  mean  standard deviation  uniform distribution  variance
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号