Pbit and other list sorting algorithms
Data Structures and Algorithms
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0511020,
title = {Pbit and other list sorting algorithms},
author = {David S. Płaneta},
journal= {arXiv preprint arXiv:cs/0511020},
year = {2007}
}
Comments
25 pages, 4 tables