Abstract—Computing problems have been important since the earliest civilizations. These problems and solutions are used for the study of the universe. Numbers and symbols have been used for different fields, for example mathematics and statistics. After the emergence of computers, number and objects must be arranged in a particular order, that is, in ascending and descending order. The order of these numbers is generally called sorting. Sorting has become very important in computing and its applications relate to file systems, etc. A number of sorting algorithms have been proposed with varying temporal and spatial complexities. In this article, the author will propose a new sorting algorithm, namely sorting by relative division and concatenation, implement the algorithm, and then compare the results with some of the existing sorting algorithms. The time and space complexity of the algorithm will also be part of this article.Keywords: New sorting, time complexity, RSCS.I. INTRODUCTIONSorting has become very important in computing and its applications concern file systems, sequential and multiprocessing computing and an essential part of database systems. A number of sorting algorithms have been proposed with varying temporal and spatial complexities. There is no single sorting algorithm suitable for every situation. Donald Knuth in [1] reports that "computer manufacturers in the 1960s estimated that more than 25 percent of their computers' operating time was spent sorting, when all their customers were considered." In fact, there were many installations in which the sorting task accounted for more than half of the computing time. Sorting is an important concept whenever we study algorithms. Knuth divides the taxonomy of sort... middle of paper ......s E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 7.1: Quick sort, pp. 145-149.[11] Cocktail_Sort (2009), Cocktail Sort, http://en.wikipedia.org/wiki/Cocktail_sort Accessed December 25, 2009.[12] Shell_sort, (2009), Shell Sort. http://en.wikipedia.org/wiki/Shell_sort, accessed January 12, 2010.[13] Cormen TH, Leiserson CE, Rivest RL and Stein C. [1990] (2001). "Introduction to Algorithms", 2nd edition, MIT Press and McGraw-Hill, ISBN 0-262-03293-7, pp. 27-37. Section 2.3: Algorithm design..[14] Sardar Zafar, Hina and Abdul Wahab, “A New Friend Sorting Algorithm,” Computer Science and Information Technology, International Conference on, pp. 326-329, 2009 2nd IEEE International Conference on Computing and Information Technology., 2009.