CompleteGraphSort: A complete graph structure based sorting algorithm

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 Θ(n²) in the worst-case, where n is the number of records in the given list to be sorted.