File:Bracketing pairs.svg
Size of the above preview of this SVG file: 330 × 229 pixels. Other resolutions: 960 × 665 pixels | 1,280 × 887 pixels | 3,840 × 2,660 pixels.
Original file (SVG file, nominally 306 × 212 pixels, file size: 4 KB)
This is a file from the Wikimedia Commons. Information from its description page there is shown below.
Commons is a freely licensed media file repository. You can help.
Commons is a freely licensed media file repository. You can help.
Summary
| Description |
English: The graph of a sequence of numbers, showing pairs of consecutive sequence values (thick red edges) that bracket a given value x. In a sorting algorithm by Levcopoulos & Petersson (1989) based on Cartesian trees, the time to include x in the sorted order is proportional to the logarithm of this number of bracketing pairs. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 22:35, 22 May 2009 | | 306 × 212 (4 KB) | David Eppstein | Better without the coordinate axes |
| 22:31, 22 May 2009 |  | 324 × 252 (4 KB) | David Eppstein | {{Information |Description={{en|1=The graph of a sequence of numbers, showing pairs of consecutive sequence values (thick red edges) that bracket a given value ''x''. In a sorting algorithm by Levcopoulos & Petersson (1989) based on [[:en:Cartesian tree|C |
File usage
The following page uses this file:
Global file usage
The following other wikis use this file:
- Usage on fa.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on sr.wikipedia.org
