Darksort: A New Linear Sorting Algorithm
Blake MacKenzie Burns

Blake MacKenzie Burns, Department of Computer Science, University of Toronto, Toronto, Canada.

Manuscript received on April 12, 2018. | Revised Manuscript received on April 25, 2018. | Manuscript published on July 30, 2018. | PP: 12-15 | Volume-8 Issue-2, May 2018. | Retrieval Number: B3134058218
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: This is a new paper on the algorithm “Darksort”. It is a linear sorting algorithm that operates in O(n) timeand space complexity. It uses advanced data structures to be highly applicable in many Computer Science uses. Comparisons to other linear sorting algorithms are included.
Keywords: Bayesian Information Criterion, Akaike Information Computer Science, Data Structures, Algorithms, Sorting