An O(n log m) algorithm for the Josephus Problem (Q3670552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n log m) algorithm for the Josephus Problem |
scientific article; zbMATH DE number 3825158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(n log m) algorithm for the Josephus Problem |
scientific article; zbMATH DE number 3825158 |
Statements
An O(n log m) algorithm for the Josephus Problem (English)
0 references
1983
0 references
permutation
0 references
