期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：2
页码：2252-2255
出版社：TechScience Publications
摘要：Sorting is a term which is very commonly used in computer science. It is a process of arranging items according to a certain order or in a particular sequence. The algorithm which are used for sorting generally consist of operations that includes comparison, swapping and assignment, as well as it may facilitate some other operations such as searching, arranging and merging of data. In this paper we proposed a new algorithm which is a combination of selection sort and bubble sort. During each iteration the smallest and largest elements are placed at its appropriate location. In our proposed approach, we reduces the running time complexity of selection sort in best case scenario and also improving the running time of bubble sort in worst cases .Observations and results are reported in support of the proposed idea
关键词：Combined Selection Bubble Sort; Bubble sort;Selection sort; Best Case; Run time Complexity.
