FDM SORT: An External and Distributed Sorting

Abstract Distribution is a competent method for sorting proving by many of them in terms of complexity with little comparisons. In this paper we put forward an approach to sort elements by distribution using Fibonacci Sequence and a small number of arithmetic calculations. It has no comparisons in case of distinctive set of data elements. If elements are repetitive then only comparison exist at the distributed position where repetitive element exists. The sorting technique uses array of four dimensions or sparse matrix or any other possible data structure that hold the distributed element externally. Spectral test prove that the distribution by dimensional approach is a proficient method for unique distributions. This algorithm is capable to sort either set of positive or set of negative values in any range. Due to limits it can not sort a set of values that contain both positive and negative