Accession Number:

AD0256333

Title:

A SORTING PROBLEM

Descriptive Note:

Corporate Author:

CASE INST OF TECH CLEVELAND OHIO

Personal Author(s):

Report Date:

1961-04-01

Pagination or Media Count:

1.0

Abstract:

A low upper bound is established for the number of comparisons required to sort n objects under the condition that the number of permutations be no larger than the number of comparisons. Author

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE