Pbit and other list sorting algorithms

Details Pbit and other list sorting algorithms Pbit and other list sorting algorithms

2005-11-04

arxiv.org/abs/cs/0511020v2

Cornell University Computing and Information Science Technical Reports, 2006

Computer Science

Data Structures and Algorithms

25 pages, 4 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pbit and other list sorting algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pbit and other list sorting algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pbit and other list sorting algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57837