Document Type

Report

Date

3-1992

Embargo Period

5-7-2012

Keywords

sorting networks, adjacent transposition sorting, comparators, swaps, miniswaps, sweeps.

Language

English

Disciplines

Computer Sciences

Description/Abstract

A miniswap Si,1 ≤ i < n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and transposes them if they are out of order. A full sweep is any composition of all n - 1 possible miniswaps. We prove that the composition of any n- 1 full sweeps is a sorting function.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-05

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.