I\'m studying time complexity in school and our main focus seems to be on polynomial time O(n^c) algorithms and quasi-linear time O(nlog
O(n^c)
O(nlog
Here is a simple example with Big O( n! ):
This is in python 3.4
def factorial(n): for each in range(n): print(n) factorial(n-1)