期刊名称：International Journal of Computer Science and Management Studies
电子版ISSN：2231-5268
出版年度：2013
卷号：13
期号：5
出版社：Imperial Foundation
摘要：Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of some values, processes them and gives some values as output. Selection of best sorting algorithm for a particular problem depends upon problem definition. Merge Sort is the first that scales well to very large lists, because its worst-case running time is O(n log n). Together with its modest O(log n) space usage, Quick Sort is one of the most popular sorting algorithms and is available in many standard programming libraries. The most complex issue in Quick Sort is choosing a good pivot element; consistently poor choices of pivots can result in drastically slower O(n²) performance, if at each step the median is chosen as the pivot then the algorithm works in O(n log n). Finding the median however, is an O(n) operation on unsorted lists and therefore exacts its own penalty with sorting. So, we are generating a new sorting algorithm while mixing the two sorting (Merge Sort and Quick Sort) to for best results.
