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


An analysis of (h,k, 1)-Shellsort
Authors:Andrew Chi-Chih Yao
Institution:Computer Science Department, Stanford University, Stanford, California 94305, USA
Abstract:One classical sorting algorithm, whose performance in many cases remains unanalyzed, is Shellsort. Let h be a t-component vector of positive integers. An h-Shellsort will sort any given n elements in t passes, by means of comparisons and exchanges of elements. Let S>j(h; n) denote the average number of element exchanges in the jth pass, assuming that all the n! initial orderings are equally likely. In this paper we derive asymptotic formulas of Sj(h; n) for any fixed h = (h, k, l), making use of a new combinatorial interpretation of S3. For the special case h = (3, 2, 1), the analysis is further sharpened to yield exact expressions.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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