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.
7. Define the Fibonacci binary tree of order n as follows: If n=0 or n=1, the tree consists of a single node. If n>1, the tree consists of a root, with the Fibonacci tree of order n-1 as the left subtree and the Fibonacci tree of order n-2 as the right subtree. Write a method that builds a Fibonacci binary tree of order n and returns a pointer to it.
Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 151--160, New York, May 23--26
Lovelace and Hopper are by no means the only women who have made invaluable contributions to the field of computer science. Without Betty Holberton, who "devised the first sort-merge generator, for UNIVAC I" (AWC, "Frances..."), Grace Hopper would never have been able to design the first compiler. A more contemporary scientist, Dr. Anita Borg, has profoundly influenced the field by "designing and building a fault tolerant UNIX-based operating system" ("Short Biography of Anita Borg"), as well as developing a performance analysis method for high-speed memory systems. However, I've chosen to focus on Lovelace and Hopper because they are probably the most frequently mentioned women in computer science, and they represent two critical historical moments in the field: Lovelace helps to bring the first computer into being, while Hopper forges the start of the modern computer age.
Harrington, Tom. "Ranking and Number of Users." Gallaudet University Library. Gallaudet University, n.d. Web. 2 Dec 2013.
[7] Elmasri & Navathe. Fundamentals of database systems, 4th edition. Addison-Wesley, Redwood City, CA. 2004.
Brookshear, J. G., Smith, D. T. and Brylow, D. (2011) Computer Science: An Overview. 11th ed. Prentice Hall / ADDISON WESLEY Publishing Company Incorporated. Available at: http://books.google.com/books?id=LbtoewAACAAJ.
Ceruzzi, P. E. (1998). A history of modern computing (pp. 270-272). London, England: The MIT Press.
Barbara Mowat and Paul Warstine. New York: Washington Press, 1992. Slethaug, Gordon. A. See "Lecture Notes" for ENGL1007.
There are a lot of searching algorithms, from which Linear Search Algorithm is one of the simple and easy algorithm, but it also have complexity, which we discuss here,
9 Fayyad U., Piatetsky-Shapiro G., Smyth, Padhraic - "The KDD Process for Extracting Useful Knowledge from volumes of Data" - Communications of the ACM vol. 39, no. 11 (Nov. 1996).
...s or user feedback, related patterns and similar approaches for possible solutions .to this problem, and source code (Hagge, & Lappe, 2005).
HAND, D. J., MANNILA, H., & SMYTH, P. (2001).Principles of data mining. Cambridge, Mass, MIT Press.
Generates a population of points for each iteration, leading to multiple options for solution out of which the best is to be selected.
This white paper identifies some of the considerations and techniques which can significantly improve the performance of the systems handling large amounts of data.
The article Guest Editors' Introduction: Algorithms and Today's Practitioner is about the use of algorithms in the world of software engineering. An algorithm is a set of rules that need to be followed in problem-solving operations .The practice of finding and using new algorithms had really died down until someone almost found the solution to the P=NP problem. The P=NP problem asks if a problem that can be verified by a computer quickly can be solved quickly by a computer. This boosted the interest of “algorithmic advances.” Since this increase in interest of algorithms, more people have wanted to become software