On the Robustness of k-Sort and its Comparison to Quick Sort in Average Case

摘要

The present paper examines the robustness of the average case O (nlogn) complexity on K-sort, a new version of quick sort. In our first study we reconfirm this through computer experiments. A computer experiment is a series of runs of a code for various i