| Display title | Module:Exponential search/doc |
| Default sort key | Exponential search/doc |
| Page length (in bytes) | 4,036 |
| Namespace ID | 828 |
| Namespace | Module |
| Page ID | 3140 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Prd (talk | contribs) |
| Date of page creation | 08:50, 17 February 2025 |
| Latest editor | Prd (talk | contribs) |
| Date of latest edit | 02:27, 11 March 2025 |
| Total number of edits | 5 |
| Total number of distinct authors | 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. | This module provides a generic exponential search algorithm. This kind of search can be useful when you want to find a key in some kind of sorted array, and you want to do it by checking as few array elements as possible. This could include situations like:
Finding the highest archive number in a set... |
