Unverified50% confidenceFactExact time
Binary search locates an element in a sorted array in only O(log n) comparisons, and the search and insertion operations of a balanced binary search tree also have O(log n) time complexity.
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% similarVerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.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)