TreeviewCopyright © aleen42 all right reserved, powered by aleen42
How to analyse an algorithm Back
Main thoughts of designing algorithms:
Sometimes, the performance of an algorithm matters so much, when the size of a problem n is so big.
It is not always true for high performance, when an algorithm depends on what is more important like the following items:
- programmer time(編程效率)
There are three kinds of analysis:
- Worst-case(考慮該類問題的最優解, 關注最壞情況下的最好情況)
There are three notations of time
θ (drop low-order terms, and ignore leading constants)
2. Recursive Algorithm
Substitution: 猜想 (通常通過畫Recursive Tree來給出猜想) 並證明
- Recursive Tree: 通過畫出遞歸樹來求解開銷
As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.
Notice: This plugin has used Cookie to store your token with an expiration.