You use time complexity and space complexity functions to compare the algorithm to others of a similar nature (one sorting algorithm to another sorting algorithm, for example).

Usually, we specify the complexity of an algorithm using the notation O (.), which indicate 'the order of'. For example, the complexity of sorting N numbers using the bubble sort method is O (N2) and ...