Analysis of computational systems: Cumulative polygon address calculation sorting

The cumulative polygon address calculation sort has been shown to be of considerably more general use, in terms of speed, robustness, and capacity than previously investigated algorithms. A method will be given which will make it possible for the file to be sorted in place instead of in a work area. There will not be space in this paper to derive expressions for the expected number of comparisons and exchanges as well as storage and time estimates. Instead the effect of the simplifying assumptions will be discussed in the light of their effect upon “sorting in place.”