Pbit and other list sorting algorithms
<|reference_start|>Pbit and other list sorting algorithms: Pbit, 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.<|reference_end|>
@article{płaneta2005pbit,
    title={Pbit and other list sorting algorithms},
    author={David S. P{l}aneta},
    journal={Cornell University Computing and Information Science Technical
  Reports, 2006},
    year={2005},
    number={TR2006-2013},
    archivePrefix={arXiv},
    eprint={cs/0511020},
    primaryClass={cs.DS}
}