📅  最后修改于: 2022-03-11 15:00:33.098000             🧑  作者: Mango
The Big O notation is used to express the upper bound of the runtime of an algorithm and thus measure the worst-case time complexity of an algorithm. It analyses and calculates the time and amount of memory required for the execution of an algorithm for an input value.