| Display title | Measure of presortedness |
| Default sort key | Sorting Algorithm |
| Page length (in bytes) | 8,699 |
| Namespace ID | 0 |
| Page ID | 324137 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Steve Marsio |
| Date of page creation | 21:22, 27 September 2021 |
| Latest editor | imported>Steve Marsio |
| Date of latest edit | 21:22, 27 September 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, a measure of presortedness of a sequence represents how much work is required to sort the sequence. If the sequence is pre-sorted, sorting the sequence entirely require little work, hence it is expected to have a small measure of presortedness. In particular, the measure of a sorted... |
