| Display title | Closest-pair problem/Fortran |
| Default sort key | Closest-pair problem/Fortran |
| Page length (in bytes) | 7,456 |
| Namespace ID | 0 |
| Page ID | 3098 |
| 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 | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Glennj |
| Date of page creation | 17:29, 8 January 2010 |
| Latest editor | PureFox (talk | contribs) |
| Date of latest edit | 13:55, 1 September 2022 |
| Total number of edits | 3 |
| Recent number of edits (within past 180 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 defines the point type and implements only two operations on "vectors" ("difference" and "length") Then we need a modified version of the fortran quicksort... |
