File:Bracketing pairs.svg
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. |
