Pbit and other list sorting algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
25 pages, 4 tables

Keywords

Data Structures and Algorithms, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/104389

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0511020
 http://arxiv.org/abs/cs/0511020
 Cornell University Computing and Information Science Technical Reports, 2006

Collections

arXiv