2020年10月23日
What is the difference between Θ(n) and O(n)?
摘要： Short explanation: If an algorithm is of Θ(g(n)), it means that the running time of the algorithm as n (input size) gets larger is proportional to g(n 阅读全文
posted @ 2020-10-23 16:00 Jasper2003 阅读(88) 评论(0) 推荐(0) 编辑