Thumbnail
Access Restriction
Subscribed

Author Pohl, Ira
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Computational complexity ♦ Computational combinatorics ♦ Sorting
Abstract A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique.
Description Affiliation: Univ. of California, Santa Cruz, Santa Cruz (Pohl, Ira)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 6
Page Count 3
Starting Page 462
Ending Page 464


Open content in new tab

   Open content in new tab
Source: ACM Digital Library