Abstract

One of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising.