WEKO3
-
RootNode
アイテム
Every Two-times Sorting Sequence Falls onto a Cycle
https://ipsj.ixsq.nii.ac.jp/records/97480
https://ipsj.ixsq.nii.ac.jp/records/97480a3250c65-ef9b-46a1-80e3-79ee391f7b4d
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2001 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Symposium(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2001-10-26 | |||||||
タイトル | ||||||||
タイトル | Every Two-times Sorting Sequence Falls onto a Cycle | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Every Two-times Sorting Sequence Falls onto a Cycle | |||||||
言語 | ||||||||
言語 | eng | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||
資源タイプ | conference paper | |||||||
著者所属 | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属 | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属 | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属 | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Computer Science, Shizuoka University | ||||||||
著者名 |
Sakuta, Makoto
Araya, Makoto
Haque, Zahidul
Iida, Hiroyuki
× Sakuta, Makoto Araya, Makoto Haque, Zahidul Iida, Hiroyuki
|
|||||||
著者名(英) |
Sakuta, Makoto
Araya, Makoto
Haque, Zahidul
Iida, Hiroyuki
× Sakuta, Makoto Araya, Makoto Haque, Zahidul Iida, Hiroyuki
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | A two-times sorting sequence is constructed by calculating the next number with doubling the current number and sorting its digits into non-decreasing order. We propose the appropriate representation of a number with the arbitrary length of digits and the algorithms to calculate the sequence. Using this representation, we investigate two important properties of the sequence, i.e., cyclic and inductive. By the examination of the computer program, it is proved that every two-times sorting sequence falls onto a periodic cycle with the cyclic length 1, 2, 3, 4, 5, 6, or 12. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | A two-times sorting sequence is constructed by calculating the next number with doubling the current number and sorting its digits into non-decreasing order. We propose the appropriate representation of a number with the arbitrary length of digits and the algorithms to calculate the sequence. Using this representation, we investigate two important properties of the sequence, i.e., cyclic and inductive. By the examination of the computer program, it is proved that every two-times sorting sequence falls onto a periodic cycle with the cyclic length 1, 2, 3, 4, 5, 6, or 12. | |||||||
書誌情報 |
ゲームプログラミングワークショップ2001論文集 巻 2001, 号 14, p. 48-55, 発行日 2001-10-26 |
|||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |