O(1)- no loops O(log n)- binary search. O(sqrt n) - finding prime number O(n)- any normal loop O(n log n)- binary sorting 0(n^k)- k nested loops O(2^n)- very rarely recursive programs 0(n!)-itertools