Content deleted Content added
The Firefox note was rather useless; I added a much more important advantage of mergesort which is more relevant today. |
→Comparison of algorithms: +http://www.springerlink.com/content/d7348168624070v7/ |
||
Line 254:
| Luck
| align="left" | Randomly permute the array and check if sorted.
|- align="center"
|<ref>http://www.springerlink.com/content/d7348168624070v7/</ref>
|{{Sort|50|<math> \mathcal{} - </math>}}
|style="background:#ddffdd"|{{Sort|20|<math> \mathcal{} n \log n </math>}}
|style="background:#ddffdd"|{{Sort|20|<math> \mathcal{} {n \log n} </math>}}
|style="background:#ddffdd"|{{Sort|00|<math> \mathcal{} {1} </math>}}
|style="background:#ddffdd"| Yes
|
| align="left" |
|}
| |||