Binar Sort: A Linear Generalized Sorting Algorithm
Published in arXiv (Cornell University) • Nov 21, 2008
NobleIDNI5P62W97R73S78
Authors:
William F. Gilreath
Abstract
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance st...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!