Unranking Combinations Lexicographically: an efficient new strategy compared with others - Sorbonne Université
Pré-Publication, Document De Travail Année : 2020

Unranking Combinations Lexicographically: an efficient new strategy compared with others

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-02462764 , version 1

Citer

Cyann Donnot, Antoine Genitrini, Yassine Herida. Unranking Combinations Lexicographically: an efficient new strategy compared with others. 2020. ⟨hal-02462764⟩
438 Consultations
630 Téléchargements

Partager

More