Abstract—Computational problems have had significance since the earliest civilizations. These problems and solutions are used to study the universe. Numbers and symbols have been used for different fields, such as mathematics and statistics. After the advent of computers, the number and objects must be arranged in a particular order, i.e. in ascending and descending order. The ordering of these numbers is generally referred to as sorting. Sorting has gained much importance in computer sciences and its applications are in file systems, etc. Numerous sorting algorithms with different temporal and spatial complexities have been proposed. In this article the author will propose a new sorting algorithm, namely Relative Split and Concatenate Sort, 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. INTRODUCTION Sorting has gained much importance in computer science and its applications are in file systems, sequential and multiprocessor processing, and a fundamental part of database systems. Numerous sorting algorithms with different temporal and spatial complexities have been proposed. There is no best sorting algorithm for every situation. Donald Knuth in [1] reports that “computer manufacturers of the 1960s estimated that more than 25% of their computers' runtime was spent on sorting, when all their customers were taken into account. In fact, there were many installations where the sorting task was responsible for more than half of the computation time.” Sorting is a significant concept whenever we study algorithms. Knuth divides sorting taxonomy...... middle of paper...... 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:Quicksort, pp.145–149.[11] Cocktail_Sort(2009), Cocktail Sort, http://en.wikipedia.org/wiki/Cocktail_sort Accessed 25 December 2009.[12] Shell _sort, (2009), Shell Sort. http://en.wikipedia.org/wiki/Shell_sort, accessed January 12, 2010.[13] Cormen T. H, Leiserson C.E., Rivest R.L., 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 friends sort algorithm,” Computer Science and Information Technology, International Conference on, pp. 326-329, 2009 2nd IEEE International Conference on Computing and Information Technology, 2009.