A New Sorting Algorithm for Integer Values (Array Sorting Algorithm).

Sorting algorithm is an old classic practice. Beginners in programming practice it to test their understanding of programming concepts. This paper presents a new sorting algorithm, which the author coins as Array Sorting Algorithm (ASA). It works only if the elements to be sorted are positive integers. Most database systems use positive integer numbers as primary keys. Other important data fields, such as IDs, bank accounts, and aviation tickets use positive integers. none Comparisonbased Sorting. The real challenge when dealing with ASA is the repeated elements to be sorted, which the present study tackles using a two-dimensional array. The second column is used as a counter, in order to show the repetition of each element. The complexity of the founded sorting algorithms was bubble sort, selection sort, and insertion sort algorithms. Their complexity is O(n * log n). ASA's complexity varies between O(n), best-case, and O(2*n), worst case. This depends on whether or not the value of the elements is repeated. Another advantage of ASA is its simplicity in understanding and implementation. The none Comparison-based Sorting algorithms prevail the lower bound of O(n*log n) of the comparison-based sorting algorithms because they do not use comparison sort.. [ABSTRACT FROM AUTHOR]