Constructing sorting networks from k-sorters

Document Type

Article

Publication Date

11-30-1989

Abstract

We study the problem of using sorters of k values to form large sorting and merging networks. For n an integral power of k, we show how to merge k sorted vectors of length n k each using 4logkn-3 layers of k-sorters and 4logk n-5 layers of k-input binary mergers. As a result, we show how to sort n values using 2log2kn-logkn layers of k-sorters and 2log2kn-3logkn+1 layers of k-input binary mergers. © 1989.

Identifier

0024769865 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/0020-0190(89)90196-8

ISSN

00200190

First Page

157

Last Page

162

Issue

3

Volume

33

This document is currently not available here.

Share

COinS