Consider an algorithm which has two nested for loops, the outer one ranging from i$=1$ to n$,$ and the inner one ranging from j$=1$ to n $($inside the inner loop there is some unknown piece of code$).$ Then you can conclude the running time of the algorithm must be $\backslash$Omega $($n$^2).$