Deltasort-A sorting algorithm for difference lists

A new sorting technique is developed to order lists in which are given not the elements to be sorted, but differences between each element and its preceding one. The deltasort algorithm uses little core-memory, and is rather quick, and can be applied to endless lists.