Show simple item record

dc.contributor.authorPlaneta, Daviden_US
dc.date.accessioned2007-04-04T20:21:13Z
dc.date.available2007-04-04T20:21:13Z
dc.date.issued2006-01-18en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2006-2013en_US
dc.identifier.urihttps://hdl.handle.net/1813/5713
dc.description.abstractPbit, besides its simplicity, is definitely the fastest list sorting algorithm. It considerably surpasses all already known methods. Among many advantages, it is stable, linear and be made to run in place. I will compare Pbit with algorithm described by Donald E. Knuth in the third volume of ''The Art of Computer Programming'' and other (QuickerSort, MergeSort) list sorting algorithms.en_US
dc.format.extent458566 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePbit and other list sorting algorithmsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics