Pbit and other list sorting algorithms

Simple item page
dc.creatorPłaneta, David S.
dc.date2005-11-04
dc.date2006-01-16
dc.date.accessioned2026-07-07T06:49:33Z
dc.date.available2026-07-07T06:49:33Z
dc.descriptionPbit, 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.
dc.description25 pages, 4 tables
dc.identifierhttps://arxiv.org/abs/cs/0511020
dc.identifierhttp://arxiv.org/abs/cs/0511020
dc.identifierCornell University Computing and Information Science Technical Reports, 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104389
dc.subjectData Structures and Algorithms
dc.subjectF.2.2
dc.titlePbit and other list sorting algorithms
dc.typetext

Files

Collections

arXiv