Unverified50% confidenceFactExact time
The floating-point to string problem has deep connections with continued fraction theory and Stern-Brocot trees in number theory, and finding the rational number with the smallest denominator within an interval is equivalent to searching in a Stern-Brocot tree.
1
Sources
50%
Confidence
Long-term
Relevance
8/16/2026
First Seen
Sources
浮点数转字符串：你从未听说过的极速算法解析
Related Claims
Unverified树形结构如前缀树Trie、R树能以O(log n)复杂度实现按需检索64% similarUnverifiedCosine similarity only cares about vector direction and not length, with values strictly falling in the range [-1, 1].59% similarUnverified循环双覆盖猜想横跨拓扑图论、代数图论和组合数学多个子领域，与四色定理、Petersen猜想等难题深度关联58% similarUnverifiedKruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树56% similarUnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/754591API
curl https://kongchang.com/api/v1/knowledge/claims/754591MCP
get_claim(id=754591)