Unverified50% confidenceFactExact time
二分查找在有序数组中定位元素只需O(log n)次比较，平衡二叉搜索树的查找和插入操作也是O(log n)时间复杂度
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
Unverified非原生图数据库需通过全局索引查找相邻节点，时间复杂度随图规模增长为O(log n)甚至O(n)76% similarUnverified树形结构如前缀树Trie、R树能以O(log n)复杂度实现按需检索75% similarVerified匈牙利算法的时间复杂度为O(n³)，能在二部图匹配问题中找到全局最优分配71% similarUnverifiedHNSW以接近O(log n)的复杂度找到近似最优解，并支持动态插入新向量而无需重建整个索引70% similarUnverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/829569API
curl https://kongchang.com/api/v1/knowledge/claims/829569MCP
get_claim(id=829569)