ACM

Communications of the ACM

Home/Magazine Archive/July 1969 (Vol. 12, No. 7)/On the expected lengths of sequences generated in.../Abstract

On the expected lengths of sequences generated in sorting by replacement selecting

By William W. Hooker
Communications of the ACM, July 1969, Vol. 12 No. 7, Pages 411-413
10.1145/363156.363189
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

In the replacement-selecting technique of sorting, one is interested in the ratio Lj of the expected length of the jth sequence generated by the technique to the number of memory cells used. Using complex-variable theory, it is shown that Lj → 2 and that, asymtotically, the average interval between sign changes of Lj — 2 is 2.6662.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.