﻿ Relative Split and Concatenate Sort (RSCS-V1) - Volume 4, Number 2 (Apr. 2012) - IJCTE
• Mar 27, 2019 News!Vol.11, No.2 has been published with online version.
• Aug 06, 2018 News!Vol.9, No.1-Vol.9, No.4 have been indexed by EI (Inspec).
• Mar 27, 2019 News!Vol.9, No.1-Vol. 10, No. 6 have been indexed by Crossref.
General Information
Editor-in-chief
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2012 Vol.4(2): 304-308 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2012.V4.471

# Relative Split and Concatenate Sort (RSCS-V1)

Abdul Wahab Muzaffar, Naveed Riaz, Juwaria Shafiq, and Wasi Haider Butt

Abstract—Computational problems have significance from the early civilizations. These problems and solutions are used for the study of universe. Numbers and symbols have been used for mathematics, statistics. After the emergence of computers the number and objects needs to be arranged in a particular order either ascending and descending orders. The ordering of these numbers is generally referred to as sorting. Sorting has many applications in computer systems, file management, memory management. Sorting algorithm is an algorithm by which elements are arranged in a particular order following some characteristic or law. A number of sorting algorithms have been proposed with different time and space complexities. In this research author develop a new sorting technique to keep in view the existing techniques. Author also proposed the algorithm i.e. Relative Split and Concatenate Sort, implements the algorithm and then compared results with some of the existing sorting algorithms. Algorithm’s time and space complexity is also being the part of this paper. With respect to complexity sorting algorithms mainly can be divided into 2 categories: O(n2) and O(nlogn). The proposed algorithm Split and Concatenate Sort is under the category of O(n2) and is efficient, in terms of time complexity, than existing algorithms lay in this category. It is discovered that the algorithms proposed in this research is relatively simpler and efficient than some of the existing well known sorting algorithms i.e. bubble sort, insertion sort and selection sort.

Index Terms—Relative, concatenate, split, sort, RSCS, timecomplexity.

Abdul Wahab Muzaffar, Juwaria Shafiq, and Wasi Haider Butt are with the National University of Sciences and Technology (NUST), Islamabad, Pakistan (e-mail: Wahab_muzaffar2000@ yahoo.com, juwaria.shafiq@gmail.com, butt.wasi@gmail.com).
Dr. Naveed Riaz is with the Shaheed Zulfiqar Ali Bhutto Institute of Science and Technology (e-mail: nransari@hotmail.com).

[PDF]

Cite: Abdul Wahab Muzaffar, Naveed Riaz, Juwaria Shafiq, and Wasi Haider Butt, "Relative Split and Concatenate Sort (RSCS-V1)," International Journal of Computer Theory and Engineering vol. 4, no. 2, pp.  304-308, 2012.