publication . Preprint . 2008

Binar Sort: A Linear Generalized Sorting Algorithm

Gilreath, William F.;
Open Access English
  • Published: 20 Nov 2008
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 stems from the fact that the sorting algorithms use the ordering property of the data. The sorting algorithm uses comparison by the ordering property to arrange the data elements from an initial permutation into a sorted permutation. Linear O(N) sorting algorithms exist, but use a priori knowledge of the data to use a specific property of the data and thus have greater ...
Subjects
ACM Computing Classification System: Data_FILES
free text keywords: Computer Science - Data Structures and Algorithms, B.2.4, F.2.2
Download from

[ANSI 1986] American National Standards Institute, "Coded Character Set - 7-bit American Standard Code for Information Interchange", ANSI X3.4, 1986.

[Knuth 1998] Knuth, Donald E. The Art of Computer Programming, 2nd edition. AddisonWesley, Reading, Massachusetts, 1998.

[Unicode 2006] The Unicode Standard, Version 5.0, Fifth Edition, The Unicode Consortium, Addison-Wesley Professional, 2006.

[Yergeau 2003] Yergeau, F., "UTF-8, a transformation format of ISO 10646", STD 63, RFC 3629, November 2003.

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue