Analysis of the Complexity of Quick Sort for Two Dimension Table
Hu Feng · Chinese Journal of Computers · 2007
Suppose the data in a two dimension table is uniform distribution,the problem of sorting a two dimension table with quick sort algorithm is analyzed.Its average time complexity and space complexity are resulted.The result of the average time complexity for sorting a two dimension table,O(n×(m+log n)),corrects and improves already known result(O(m×n×log n))in literatures,where,m is the number of its