Pbit and other list sorting algorithms

TL;DR

Pbit is a simple, stable, linear, in-place list sorting algorithm that outperforms traditional methods like QuickerSort and MergeSort, as demonstrated through comparisons with established algorithms.

Contribution

Introduces Pbit as a new, faster list sorting algorithm that is stable, linear, and can be implemented in place, surpassing existing methods.

Findings

Pbit is faster than Knuth's algorithm, QuickerSort, and MergeSort.

Pbit maintains stability and linear time complexity.

Pbit can be implemented in place, reducing space requirements.

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.