In-place random list permutations
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
257 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
255 | en_US |
dc.citation.volume |
70 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Hwang, WP | en_US |
dc.contributor.author |
Wang, CL | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:46:27Z | |
dc.date.available |
2014-12-08T15:46:27Z | |
dc.date.issued |
1999-06-30 | en_US |
dc.description.abstract |
We give two algorithms to randomly permute a linked list of length n in place using O(n log n) time and O(log n) stack space in both the expected case and the worst case. The first algorithm uses well-known sequential random sampling, and the second uses inverted sequential random sampling. (C) 1999 Published by Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0020-0190(99)00076-9 | en_US |
dc.identifier.issn |
0020-0190 | en_US |
dc.identifier.journal |
INFORMATION PROCESSING LETTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0020-0190(99)00076-9 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/31273 | |
dc.identifier.wosnumber |
WOS:000082629700001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
algorithms | en_US |
dc.subject |
data structures | en_US |
dc.title |
In-place random list permutations | en_US |
dc.type |
Article | en_US |
檔案
- 000082629700001.pdf (38.2 KB, Adobe PDF)
所屬典藏: 期刊論文