aboutsummaryrefslogtreecommitdiffstats
path: root/meowpp/dsa/VP_Tree.h
diff options
context:
space:
mode:
Diffstat (limited to 'meowpp/dsa/VP_Tree.h')
-rw-r--r--meowpp/dsa/VP_Tree.h4
1 files changed, 3 insertions, 1 deletions
diff --git a/meowpp/dsa/VP_Tree.h b/meowpp/dsa/VP_Tree.h
index 669eb0f..1877b74 100644
--- a/meowpp/dsa/VP_Tree.h
+++ b/meowpp/dsa/VP_Tree.h
@@ -158,7 +158,9 @@ namespace meow{
//#
//#[NOTE]
//#========================================
- //# * 實測結果發覺比 `KD_Tree` 有效率多了...
+ //# * 實測結果發覺, 維度小的時候, 比起中規中矩的 `KD_Tree`, `VP_Tree` 有
+ //# 'randomp' 於其中, 因此時間複雜度只是期望值 'O(logN)' 但是測資大到
+ //# 一定程度, `KD_Tree` 效率會一整個大幅掉下, 但 `VP_Tree` 幾乎不受影響
//# * 'TODO' `insert()`, `erase()` 算是未完成功能
//#
//#========================================