Using the complete sequences for sorting natural numbers

MaRDI QIDQ1789732zbMATH OpenFDO

Authors Yuriĭ Nikolaevich Artamonov

Publication date 10 October 2018

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Full work available at URL http://mathizv.isu.ru/journal/downloadArticle?article=_fdd086ab3bda42478e0777d7052cb281&lang=rus

zbMATH Keywords

complete sequenceslinear timesorting algorithmsradix sortalgorithms for searching and storing of numerical datanontraditional number systems

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• \(r\)-completeness of sequences of positive integers
• A construction of short sequences containing all permutations of a set as subsequences
• Recalculation, numbering and generation of serial sequences with detached natural series
• Discrete orthogonal transforms on multisets associated with complete sequences
• On weakly complete sequences formed by the greedy algorithm

Cites work

• scientific article; zbMATH DE number 3906412 (Why is no real title available?)
• Algorithm design: Foundations, analysis, and Internet examples
• Group choice using matrix norms

This page was built for publication: Using the complete sequences for sorting natural numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789732)