A note on gray code and odd-even merge

Gerhard Larcher*, Robert F. Tichy

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Asymptotic results for the sum-of-digits function with respect to Standard-Gray-code representation of positive integers are established. These estimates yield two bounds for the average case complexity of Batcher's odd-even merge.

Original languageEnglish
Pages (from-to)309-313
Number of pages5
JournalDiscrete Applied Mathematics
Issue number3
Publication statusPublished - Dec 1987
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'A note on gray code and odd-even merge'. Together they form a unique fingerprint.

Cite this