engleski

An Improved Circle Sort Algorithm

The circle sort algorithm was introduced in 2005 by Bezemer and Olufem, and it is still not completely researched. The experiments show that the algorithm is comparable with the Shell sort algorithm. Its complexity is still not definitely determined. This paper gives optimized circle sort algorithm, which proved to be up to 25% faster than the original one, depending on data distribution. In the proposed algorithm the novel, more symmetric treatment of the central element is proposed, and unnecessary recursive calls are eliminated to improve the overall performance

Sorting ; Circle Sort ; Complexity

nije evidentirano