A SORTING PROBLEM
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1961
- Accession Number
- AD0256333
Entities
People
- R.c. Bose
- R.j. Nelson
Organizations
- Case Western Reserve University