New Relative Concatenate Sorting algorithm

Sorting is technique by which elements are arranged in a particular order following some characteristic or law [1]. In this paper we presented an algorithm called as Relative Concatenate Sort, which is based on the idea of Selection Sort, but it divides the list into two. After dividing the list it takes the average of both halves of the list. Comparing this average with elements it sorts both arrays and then put these arrays together to get the final sorted list.