docs(search): update performance summary section for search policies

Author: mgyoo86

docs/src/guides/search/policies.md

@@ -82,16 +82,6 @@ end
 
 **How it works**: Walks linearly from the hint position one interval at a time. Without a step limit, it will traverse the entire grid if necessary—which is optimal for close queries but catastrophic for distant ones.
 
-### Performance Summary
-
-| Query Pattern | `Binary()` | `LinearBinary()` | `Linear()` |
-|:--------------|:-----------|:-----------------|:-----------|
-| **Random** | ✅ Best | ~2-3x slower | ❌ Up to 7x slower |
-| **Monotonic** | Baseline | ✅ ~5x faster | ✅ ~6x faster |
-
-!!! note "Results Vary"
-    These are approximate results from a 500-point grid with 1000 queries. Actual performance depends on your **grid size** and **query spacing**. Run benchmark with your own data to find the best policy.
-
 ---
 
 ## LinearBinary
@@ -133,6 +123,18 @@ LinearBinary(linear_window=16) # larger bound for sparser queries
 
 ---
 
+## Performance Summary
+
+| Query Pattern | `Binary()` | `LinearBinary()` | `Linear()` |
+|:--------------|:-----------|:-----------------|:-----------|
+| **Random** | ✅ Best | ~2-3x slower | ❌ Up to 7x slower |
+| **Monotonic** | Baseline | ✅ ~5x faster | ✅ ~6x faster |
+
+!!! note "Results Vary"
+    These are approximate results from a 500-point grid with 1000 queries. Actual performance depends on your **grid size** and **query spacing**. Run benchmark with your own data to find the best policy.
+
+---
+
 ## Baked-in vs Override
 
 ### Baked-in Policy (Constructor)