| Display title | Sorting algorithms/Merge sort |
| Default sort key | Sorting algorithms/Merge sort |
| Page length (in bytes) | 244,580 |
| Namespace ID | 0 |
| Page ID | 889 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 152 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Mwn3d |
| Date of page creation | 19:22, 5 February 2008 |
| Latest editor | Zeddicus (talk | contribs) |
| Date of latest edit | 22:02, 4 March 2025 |
| Total number of edits | 512 |
| Recent number of edits (within past 180 days) | 17 |
| Recent number of distinct authors | 3 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The merge sort is a recursive sort of order n*log(n). It is notable for having a worst case and average complexity of O(n*log(n)), and a best case... |
