big -O notation · Definition: A theoretical measure of the execution of an algorithm, usually the time or memory needed, given the problem size n, which is ...
確定! 回上一頁