Unranking Combinations Lexicographically: an efficient new strategy compared with others - Sorbonne Université
Preprints, Working Papers, ... Year : 2020

Unranking Combinations Lexicographically: an efficient new strategy compared with others

Abstract

We propose a comparative study of four algorithms dedicated to the lexicographic unranking of combinations. The three first ones are algorithms from the literature. We give some key ideas how to analyze them in average and describe their strengths and weaknesses. We then introduce a new algorithm based on a new strategy inside the classical factorial numeral system (or factoradics). We conclude the paper with an experimental study, in particular when n = 10000; k = 5000, our algorithm is 36 (resp. 53) times as fast as our C++ implementation of Matlab's (resp. Sagemath's) algorithm.
Fichier principal
Vignette du fichier
paper.pdf (653.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02462764 , version 1 (31-01-2020)

Identifiers

  • HAL Id : hal-02462764 , version 1

Cite

Cyann Donnot, Antoine Genitrini, Yassine Herida. Unranking Combinations Lexicographically: an efficient new strategy compared with others. 2020. ⟨hal-02462764⟩
395 View
608 Download

Share

More