| X1¡@ belong to [a1,b1] | |
|
|
X2¡@ belong to [a2,b2] |
|
|
|
|
|
|
|
|
|
| XN¡@ belong to [aN,bN] |
¡@
| N = 1 |
¡@ a1 =
b1 : internal searching
¡@ Preprocessing
¡@¡@ Range-Search
¡@ Method 1
| Preprocessing :¡@ | sorting | N logN |
| Range-Search :¡@ | binary search | R + logN |
| Keys : |
|
|
|
|
|
|
|
|
|
| Q = [2.5,7] |
¡@¡ô
|
¡ô |
| Preprocessing :¡@ | binary search tree | N logN |
| Range-Search :¡@ | Search(l,[a,b]) | R + logN |
| if a <= l.key then search (l.left , [a,b]);¡@ |
| if l.key <= b then search (l.right , [a,b]); |
| if a <= l.key <= b then print (l.key); |