Analysis of a Modified Address Calculation Sorting Algorithm
Francis Suraweera · The Computer Journal · 1988
The method of sorting by address calculation is seldom discussed in the literature although it has been around for nearly three decades. This paper presents and discusses a sorting algorithm which is similar to the address calculation sort method of Isaac and Singleton. Our algorithm is based on finding the smallest and the largest keys and makes use of assign and test-zero type operations. The complexity of the algorithm depends on a certain parameter. Under certain conditions, it is shown that the behaviour of the algorithm is linear. For another range of values of the parameter the algorithm is comparable to other good sorting algorithms. The algorithm is compared with the recursive Quicksort algorithm and comparative timings are given to illustrate its efficiency.