In-place random list permutations

檔案

日期

1999-06-30

期刊名稱

INFORMATION PROCESSING LETTERS

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料