Slow Sorting: A Whimsical Inquir y Bryant A . Julstrom Department of Computer Science St . Cloud State Universit y St . Cloud, Minnesota 5630 1 julstrom@eeyore .stcloud .msus .ed u Abstrac t Sorting is one of the most common and important computin g operations . In analyzing and comparing sorting algorithms, w e consider their execution times, as indicated by the number o f operations they execute as they sort is elements . The simples t algorithms have times that grow approximately as n 2 , whil e more complex algorithms offer times that grow approximately a s nlogn . This paper pursues a contrary goal : a sorting algorith m whose time grows more quickly than that of the well-known algorithms . The paper exhibits and analyzes such an algorithm . We divide sorting algorithms into two categories dependin g on the situations in which they apply . Internal sorting order s elements held in the computer's memory, as in an array or a linked list . External sorting orders elements held on a mas s storage device such as a disk drive . Here we consider the interna l sorting of elements held in an
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/slow-sorting-a-whimsical-inquiry-AZrEoJLr8q
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Slow sorting: a whimsical inquiry
Julstrom, Bryant A.
Follow ACM SIGCSE Bulletin
, Volume 24 (3)
Association for Computing Machinery – Sep 1, 1992
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
