PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM

M. Archibald, A. Blecher, C. Brennan, A. Knopfmacher, T. Mansour

Research output: Contribution to journalArticlepeer-review

Abstract

We define the statistic of a push for words on an alphabet [k] and use this to obtain a generating function measuring the degree to which an arbitrary word deviates from sorted order. Several subsidiary concepts are investigated: the number of cells that are not pushed, the number of already sorted columns, the number of cells that coincide before and after pushing, the fixed cells in words and finally, the frictionless pushes.

Original languageAmerican English
Pages (from-to)56-69
Number of pages14
JournalContributions to Discrete Mathematics
Volume17
Issue number1
StatePublished - 2022

Keywords

  • asymptotics
  • generating function
  • sorting
  • words

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM'. Together they form a unique fingerprint.

Cite this