Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

2-1981

Publication Source

SIAM Journal on Computing

Volume

10

Issue

1

Start Page

88

Last Page

95

DOI

10.1137/0210007

Abstract

An algorithm is given which makes only $O(\log n)$ comparisons, and which will determine the ordering of the uniformly distributed (pseudo random) Weyl sequences given by $\{ (k\alpha )\bmod 1:1 \leqq k \leqq n\} $, where $\alpha $ is an unspecified irrational number. This result is shown to be best possible in the sense that no algorithm can perform the same task with fewer than $ \Omega (\log n)$ comparisons.

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.