What is a typical measure of algorithm complexity?

A typical measure of an algorithm's complexity is time complexity, which describes how the number of operations of the algorithm grows depending on the size of the input data. It is usually expressed using Big O notation, for example, O(1), O(n), O(n²). Also important is space complexity, which shows how much memory the algorithm requires.