We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
请确认已经读过了 F.A.Q.(确认过后请将选项打钩 / 填为 [x])
[x]
是出现了什么问题?
如果一种可并堆的时间复杂度不是均摊的,那么它就可以 可持久化。
實際上,是不是均攤 (amortized complexity) 應該都算 可持久化,但如果最慘複雜度 (worst complexity) 不好,則實作上與暴力法相當。
我們大多數都希望做到的是即時可持久化結構 (Real-Time Persistent Data Structure),論文大多數也以 Real-time 一詞來移除均攤的疑慮,以確保多個版本之間不會因為卡在均攤操作的那一瞬間,讓整個熵 (entropy) 不斷地被複製。
你是否正在着手修复?否
如何复现?否
The text was updated successfully, but these errors were encountered:
Update persistent-heap.md
a655069
根据 #1950 修改了表述。具体用词可以再讨论。
No branches or pull requests
请确认已经读过了 F.A.Q.(确认过后请将选项打钩 / 填为
[x]
)是出现了什么问题?
實際上,是不是均攤 (amortized complexity) 應該都算 可持久化,但如果最慘複雜度 (worst complexity) 不好,則實作上與暴力法相當。
我們大多數都希望做到的是即時可持久化結構 (Real-Time Persistent Data Structure),論文大多數也以 Real-time 一詞來移除均攤的疑慮,以確保多個版本之間不會因為卡在均攤操作的那一瞬間,讓整個熵 (entropy) 不斷地被複製。
你是否正在着手修复?否
如何复现?否
The text was updated successfully, but these errors were encountered: