標題: In-place random list permutations
作者: Hwang, WP
Wang, CL
資訊工程學系
Department of Computer Science
關鍵字: algorithms;data structures
公開日期: 30-六月-1999
摘要: 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.
URI: http://dx.doi.org/10.1016/S0020-0190(99)00076-9
http://hdl.handle.net/11536/31273
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(99)00076-9
期刊: INFORMATION PROCESSING LETTERS
Volume: 70
Issue: 6
起始頁: 255
結束頁: 257
顯示於類別:期刊論文


文件中的檔案:

  1. 000082629700001.pdf