New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

第三題 #6

Open

ZYQue opened this issue Dec 16, 2017 · 7 comments

ZYQue commented Dec 16, 2017

第三組

Author

ZYQue commented Dec 17, 2017

HW11problem3.pptx

Member

scps940707 commented Dec 17, 2017 •

edited

Loading

投影片第3頁
- W 和 L 是什麼？沒有定義過
投影片第4頁
- 同上
- Wi,i 是什麼？我猜想你需要這個
回圈　迴圈
演算法是正確的，不過可以進行優化降低複雜度，try it！（Hint：課本和老師都有說）

Author

ZYQue commented Dec 18, 2017 •

edited

Loading

HW11problem3.pptx
改好了。麻煩助教再看一下，謝謝！

Member

scps940707 commented Dec 18, 2017

投影片第6頁
- L^{(left+right)/2} 這個地方你們要怎麼求得？

Author

ZYQue commented Dec 18, 2017

是想說就直接拿之前算過的L(2^k)來拼？比如說L(7)就是L(1)、L(2)、L(4)的“相乘”。
呃不過仔細想想這樣複雜度其實是O(n^3*log(n)log(n))。

如果還有更好的方法可以麻煩助教提示下嘛？

Member

c910335 commented Dec 18, 2017

確實是有比較好的做法
可以省下你剛剛才發現的 logn
你們可以試著想想看
沒想到的話我明天再補充

Author

ZYQue commented Dec 18, 2017

HW11problem3.pptx
不好意思麻煩助教再看一下。。似乎這樣就可以去掉了

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment