Read-backward Polyphase sorting provides more efficient use of the tapes available to a sort than most other sorting techniques. Backward Polyphase produces a continuous merging process from n - 1 ...
Add a description, image, and links to the polyphase-merge-sort topic page so that developers can more easily learn about it.
The k-generalized Fibonacci numbers are defined as in [1]. A polyphase merge (merging an equal number of sequences from k tapes onto a single unused tape) using k+1 tapes is defined in terms of linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results