Content deleted Content added
{{Sorting}} |
→Analysis: for certain values of <math>n</math> |
||
Line 35:
The number of comparisons agrees with the [[lower bound]] on comparison sorting of <math>\lceil\log_2 n!\rceil\approx n\log_2 n - 1.443n</math> up to <math>n=11</math>, but diverges for larger values of <math>n</math>.
It also compares favorably with the [[sorting number]]s, the numbers of comparisons made by binary insertion sort or merge sort in the worst case,
which are approximately <math>n\log_2 n - 0.915n</math> for certain values of <math>n</math>.{{r|fj}}
==References==
| |||