An Analysis of Sorting Networks

Abstract

Comparators which sort two numbers can be interconnected to form networks which sort N numbers for any N. The input and output characteristics of comparator networks are analyzed from several different points of view.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 20, 1972
Accession Number
AD0751614

Entities

People

  • Burton J. Smith

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Automata Theory
  • Comparators
  • Computer Programming
  • Computers
  • Construction
  • Convex Sets
  • Coverings
  • Electrical Engineering
  • Engineering
  • Massachusetts
  • New Mexico
  • New York
  • Real Numbers
  • Standards
  • United States
  • Universities

Fields of Study

  • Computer science