The input size \(n\)  depends on the problem to be studied. It can be the number of items in the input array, the number of bits needed to represent the input, or it can even be two different numbers if the input would be a graph. The running time \(f(n)\)  is the number of operations or steps executed. The time required to execute each line in pseudocode is constant. In real life, different computers execute different operations using different amounts of time, but when \(n\)  grows large enough, these differences become insignificant. [1]}
