Usort: An Efficient Hybrid of Distributive Partitioning Sorting

Simple item page
dc.contributor.authorAllison, Donald C. S.en
dc.contributor.authorNoga, M. T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:16Zen
dc.date.available2013-06-19T14:37:16Zen
dc.date.issued1981en
dc.description.abstractA new hybrid of Distributive Partitioning Sorting is described and tested against Quicksort on uniformly distributed items. Pointer sort versions of both algorithms are also tested.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000866/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000866/01/CS81012-R.pdfen
dc.identifier.trnumberCS81012-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20323en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleUsort: An Efficient Hybrid of Distributive Partitioning Sortingen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS81012-R.pdf
Size:
384.11 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports