Question

Explain, with ONE (1) example, a notation that can be used to compare the complexity of different algorithms.

Answer 1

An example is an asymptotic notation, which analyzes the running time of an algorithm. The key concept of this notation is to let the algorithm run conditionally infinite time.

For example, we want to compare the running time of two programs, but, depending on the hardware and specific conditions, they can show different results on specific times. However, if we run them infinitely long, the results give more useful data on their performance.