Skip to content
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

第八題 #8

Open
chuchutd opened this issue Dec 2, 2017 · 11 comments
Open

第八題 #8

chuchutd opened this issue Dec 2, 2017 · 11 comments

Comments

@chuchutd
Copy link

chuchutd commented Dec 2, 2017

第十四組
@woodyhoko
Copy link

Problem8_Group14.pptx

@woodyhoko
Copy link

version 2
Problem8_Group14.pptx

@woodyhoko
Copy link

version 3
Problem8_Group14.pptx

@woodyhoko
Copy link

version 4
Problem8_Group14.pptx

@c910335
Copy link
Member

c910335 commented Dec 4, 2017

print(chr(n+ord('a'))+' : '+str(temp))

看不懂這行想表達什麼
為什麼要輸出英文字母？

@woodyhoko
Copy link

為了增閱讀性

@c910335
Copy link
Member

c910335 commented Dec 4, 2017

意思是你的演算法最多只能有 26 個 tasks 嗎？

@c910335
Copy link
Member

c910335 commented Dec 4, 2017

並查集查詢及合併的 O(α(n)) 為何不用計入時間複雜度？

@woodyhoko
Copy link

了解，下一版更改為數字來表示好了

@woodyhoko
Copy link

我不太清楚要怎麼樣精算查詢所需的時間複雜度，因此直接以想到的最差情況來算。課本有8頁左右的證明過程...但好難看懂

@woodyhoko
Copy link

version 6
Problem8_Group14.pptx

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@c910335 @woodyhoko @chuchutd