ARKEPIanGraphSort: a graph based sorting algorithm

Sorting is a well-known problem frequently used in many aspects of the world of computational application. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this paper, we propose a graph based sorting algorithm, designated as ARKEPIanGraphSort that takes time ⊗(n²) in the worst-case, where n is the number of records in the given list to be sorted.