Permuting

The fundamental problem of permuting the elements of an array according to some given permutation is addressed. The goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The main result is an O(n log n)-time, O(log/sup 2/n)-space worst case method. A simpler method is presented for the case in which both the permutation and its inverse can be computed at (amortized) unit cost. This algorithm requires O(n log n) time and O(log n) bits in the worst case. These results are extended to the situation in which a power of the permutation is to be applied. A linear time, O(log n)-bit method is presented for the special case in which the data values are all distinct and are either initially in sorted order or will be when permuted. >

Authors

• Faith Ellen
• J. Ian Munro
• Patricio V. Poblete

Keywords

• Computer science
• Costs
• Councils
• Sorting
• Organizing
• Tree data structures
• Binary search trees
• Linear Time
• Array Elements
• N Log N
• Amount Of Time
• Local Minima
• Smallest Value
• Vector Of Length
• Hash Function
• Correct Location
• Tree Search
• Amount Of Space
• Binary Tree
• Recursive Algorithm
• Binary Search
• Cycling Of Elements
• Minimal Element
• Complete Tree
• Additional Bits
• Consecutive Elements