Open nus-pe-bot opened 3 years ago
Thank you for your suggestion requesting for better explanations. I think it is valid and agree that I could have been more detailed in my explanations. However, I believe this is an issue not in the scope of DG bugs; it is a request for more comprehensive explanations, which might be something I indeed am not yet able to do (haven't formally learnt about NP).
On a separate note, I hope to share with you that your second and third sentences are false, as I think.
--
Note from the teaching team: This bug was reported during the Part II (Evaluating Documents) stage of the PE. You may reject this bug if it is not related to the quality of documentation.
I suspect the author is trying to convey that with brute force approach, the time complexity in the worst case scenario has no upper bounds. Even this statement is misleading because if needed, the time complexity could be calculated to be O(f(x)) for some function f(x). It would be a lot better and more succinct if the author state that the brute force approach is inefficient.
[original: nus-cs2103-AY2021S2/pe-interim#290] [original labels: severity.Medium type.DocumentationBug]