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
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?
Favorite Quote:
>For that reason someone invented C++.
BLASPHEMY! Begone from my C board, you foul lover of objects, before the gods of C cast you into the void as punishment for your weakness! There is no penance for saying such things in my presence. You are henceforth excommunicated. Never return to this house, filthy heretic!
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
All problems in computer science can be solved by another level of indirection,
except for the problem of too many layers of indirection.
– David J. Wheeler
I thought the OP was asking for code:
Someone could help me out with some code example?
Favorite Quote:
>For that reason someone invented C++.
BLASPHEMY! Begone from my C board, you foul lover of objects, before the gods of C cast you into the void as punishment for your weakness! There is no penance for saying such things in my presence. You are henceforth excommunicated. Never return to this house, filthy heretic!
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
