## Enhanced Quicksort Algorithm (2008)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Mansi08enhancedquicksort,

author = {Rami Mansi},

title = {Enhanced Quicksort Algorithm},

year = {2008}

}

### OpenURL

### Abstract

Abstract: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research; because efficient sorting is important to optimize the use of other algorithms. It is also often in producing human-readable output. This paper presents a new sorting algorithm called SMS-algorithm (Scan, Move, and Sort). The SMS algorithm is considered as an enhancement on the Quicksort algorithm in the best, average, and worst cases when dealing with an input array of a large size and when the maximum and the minimum values were small, especially when sorting a list of distinct elements. The SMS algorithm is compared with the Quicksort algorithm and the results were promising.

### Citations

8530 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...r reordering, of the input. Since the early beginning of computing, the sorting problem has attracted many researchers, perhaps due to the time complexity of solving it efficiently [10]. As stated in =-=[2, 4]-=-, sorting has been considered as a fundamental problem in the study of algorithms, that due to many reasons: • The need to sort information is inherent in many applications. • Algorithms often use sor... |

2438 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...ys. This means, a sorting algorithm is stable if whenever there are two records R and S with the same key and with R appearing before S in the original list, R will appear before S in the sorted list =-=[1, 9]-=-. Quicksort is characterized as a “hard division and easy combination” algorithm. As mentioned in [16], there are three divide-and-conquer processes for sorting a typical sub array A[p..r]: • Divide: ... |

194 |
The Art of Computer Programming: Sorting and Searching
- Knuth
- 1975
(Show Context)
Citation Context ...ys. This means, a sorting algorithm is stable if whenever there are two records R and S with the same key and with R appearing before S in the original list, R will appear before S in the sorted list =-=[1, 9]-=-. Quicksort is characterized as a “hard division and easy combination” algorithm. As mentioned in [16], there are three divide-and-conquer processes for sorting a typical sub array A[p..r]: • Divide: ... |

86 |
C#: How to Program
- Deitel, Deitel
- 2003
(Show Context)
Citation Context ...cksort, and Insertion sort [3]. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly; it is also often in producing human-readable output =-=[6]-=-. Formally, the output should satisfy two major conditions: • The output is in non-decreasing order. • The output is a permutation, or reordering, of the input. Since the early beginning of computing,... |

51 |
Quicksort", The
- Hoare
- 1962
(Show Context)
Citation Context ...urces are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity [7]. Quicksort =-=[8]-=- was observed to be both economical and efficient. Many algorithms are very well known for sorting the unordered lists. Most important of them are Heap sort, Bubble sort, Quicksort, and Insertion sort... |

17 |
Sorting on electronic computer systems
- Friend
- 1956
(Show Context)
Citation Context .... And many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity =-=[7]-=-. Quicksort [8] was observed to be both economical and efficient. Many algorithms are very well known for sorting the unordered lists. Most important of them are Heap sort, Bubble sort, Quicksort, and... |

12 |
A fast, easy sort
- Lacey, Box
- 1991
(Show Context)
Citation Context ...was observed to be both economical and efficient. Many algorithms are very well known for sorting the unordered lists. Most important of them are Heap sort, Bubble sort, Quicksort, and Insertion sort =-=[3]-=-. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly; it is also often in producing human-readable output [6]. Formally, the output shou... |

4 |
The Principles of Sorting,” The
- Bell
- 1958
(Show Context)
Citation Context ...r reordering, of the input. Since the early beginning of computing, the sorting problem has attracted many researchers, perhaps due to the time complexity of solving it efficiently [10]. As stated in =-=[2, 4]-=-, sorting has been considered as a fundamental problem in the study of algorithms, that due to many reasons: • The need to sort information is inherent in many applications. • Algorithms often use sor... |

2 |
Simple Expected Running Time Analysis for Randomized Divide and Conquer Algorithms
- Dean, “A
- 2006
(Show Context)
Citation Context ... the main solution for the original input (combine). The principle of the divide-and-conquer algorithm design is that it is easier to solve several small instances of a problem than one large problem =-=[5, 11]-=-. In this paper, a new sorting algorithm is presented, called SMS-Algorithm (Scan, Move, and Sort). The study shows that the proposed algorithm is more efficient and faster as compared to the Quicksor... |