原位相联置换
In-situ associative permuting
摘要:
介绍了原位结合置换技术,它是原位置换和原位反演的结合。它适用于{1,2,.,n},其中将被反转的元素是负的,并且根据它们的绝对值相对于彼此按顺序存储。令K[1. n]是n个整数键的数组,每个键都在[1,n]范围内,并且允许修改范围[-n,n]内的键。如果整数键被重新排列,使得具有值i的每个不同键中的一个被移动到K的第i个位置,则所得到的排列(将由K^P表示)可以仅使用logn个附加位被就地变换成关联可置换置换排列pi^P。关联可置换置换pi^P不仅存储K^P的密钥的秩,而且唯一地表示K^P。不考虑从pi^P恢复密钥。然而,在O(n)时间内使用logn个附加位的原位关联置换pi^P将pi^P的元素按顺序重新排列,并且使用负秩的逆在O(n)时间内进一步恢复K^P的密钥。这意味着一个包含n个整数键的数组,每个键都在[1,n]范围内,可以只使用logn位的额外空间进行排序。
英文摘要:
The technique of in-situ associative permuting is introduced which is an association of in-situ permuting and in-situ inverting. It is suitable for associatively permutable permutations of {1,2,...,n} where the elements that will be inverted are negative and stored in order relative to each other according to their absolute values. Let K[1...n] be an array of n integer keys each in the range [1,n], and it is allowed to modify the keys in the range [-n,n]. If the integer keys are rearranged such that one of each distinct key having the value i is moved to the i'th position of K, then the resulting arrangement (will be denoted by K^P) can be transformed in-situ into associatively permutable permutation pi^P using only logn additional bits. The associatively permutable permutation pi^P not only stores the ranks of the keys of K^P but also uniquely represents K^P. Restoring the keys from pi^P is not considered. However, in-situ associative permuting pi^P in O(n) time using logn additional bits rearranges the elements of pi^P in order, as well as lets to restore the keys of K^P in O(n) further time using the inverses of the negative ranks. This means that an array of n integer keys each in the range [1,n] can be sorted using only logn bits of additional space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。