Header menu link for other important links
ARKEPIanGraphSort: A graph based sorting algorithm
Published in -
Volume: 4
Pages: 1386 - 1390
Sorting is a well-known problem frequently used in many aspects of the world of computational applications. 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 Θ(n2) in the worst-case, where n is the number of records in the given list to be sorted.
About the journal
JournalIEEE Region 10 Annual International Conference, Proceedings/TENCON
Open AccessNo