The Big-O-Notation example?

Hi,
I've just learnt about the Big-O-Notation and a bit confused about the O(2^n) one. Someone could help me out with some code example?

Thanks

Well, if you just learned about this why don't you show us what you have tried?

it has nothing to do with code examples... It speackes about complexity of the algorithm

For example if you say that some sorting algorithm is O(2^n) it means you should do about
k*2^n operations to sort the array of n values, where k is a constant

I thought the OP was asking for code: ;)

Quote:

---

Someone could help me out with some code example?

---

This link to Prelude's website may be helpful in understanding Big-O notation and why its used, give it a read. http://www.eternallyconfuzzled.com/a..._art_bigo.aspx