📜  如何确定函数是否具有日志复杂性 - 无论代码示例

📅  最后修改于: 2022-03-11 14:58:19.283000             🧑  作者: Mango

代码示例1
Look for an outer loop which iterates through a list (O(n)). Then look to see if there is an inner loop. If the inner loop is cutting/reducing the data set on each iteration, that loop is (O(log n))