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).

This operation has a time complexity of O (1)–constant. Recall that O (1) is pronounced “Big Oh of 1.” (See Part 1 for a reminder of how time and space complexity measurements are used to ...