Consider n a representative size in your program. Let's say nn is the length of the list you're working with.
The running time, or complexity, of an algorithm is the number of operations you need to do so that your algorithm terminates with an entry data of size nn.
You also have to choose which operations you count, only multiplications, every arithmetic operation, comparsions...
The expression of complexity $C(n)$ is generally obtained by a recursive process.
Let $p(n)$ be $n,n^3,2^n$ or $nlog(n)$ for example
To indicate complexity we use 33 functions, because $C(n)$is not very relevant :