Proposal of a New Sorting Algorithm

1532 Words4 Pages

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 different fields e.g. mathematics, statistics. After the emergence of computers the number and objects needs to be arranged in a particular order i.e. ascending and descending orders. The ordering of these numbers is generally referred to as sorting. Sorting gained a lot of importance in computer sciences and its applications are in file systems etc. A number of sorting algorithms have been proposed with different time and space complexities. In this paper author will propose a new sorting algorithm i.e. Relative Split and Concatenate Sort, implement the algorithm and then compared results with some of the existing sorting algorithms. Algorithm’s time and space complexity will also be the part of this paper.

Keywords: New Sorting, Time Complexity, RSCS.

I. INTRODUCTION

Sorting gained a lot of importance in computer sciences and its applications are in file systems, sequential and multiprocessing computing, and a core part of database systems. A number of sorting algorithms have been proposed with different time and space complexities. There is no one sorting algorithm that is best for each and every situation. Donald Knuth in [1] reports that “computer manufacturers of the 1960s estimated that more than 25 percent of the running time on their computers was spend on sorting, when all their customers were taken into account. In fact, there were many installations in which the task of sorting was responsible for more than half of the computing time.” Sorting is a significant concept whenever we study algorithms. Knuth divides the taxonomy of sorting...

... 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:Quicksort, 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 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: Designing algorithms..

[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 Computer Science and Information Technology, 2009.

Open Document