Big O notation is a convenient way to describe how fast a function is growing. It is often used in computer science when estimating time complexity.
確定！ 回上一頁
