Header menu link for other important links
CompleteGraphSort: A complete graph structure based sorting algorithm
Published in
Volume: 4
Pages: 193 - 197
Sorting is a well-known problem frequently used in many aspects in 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 solution report, a complete graph structure based comparison sorting algorithm, CompleteGraphSort has been proposed that takes time (n2) in the worst-case, where n is the number of records in the given list to be sorted. © 2011 IEEE.
About the journal
JournalProceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011