What would be a code example for this Big O Notation?
2n^2 * 2^n + logn = O(N^2*2^N)
in puedo code
or for the O notation
for i = 1 to 2*n^2
for j = 1 to 2^n
for i = 1 to log n
for i = 1 to N^2*2^N
You could do something similar to this. It's your choice
if you want to subsitute for i = 1 to n^2 with some more
meaningfull such as bubble sort.
Here's a link from google you can probably find more.