Can anyone explain me this Big-O notation is true or false
m=O(2^m)
Janakiram2571
0
Newbie Poster
TrustyTony
888
pyMod
Team Colleague
Featured Poster
You can compare to this:
http://www.daniweb.com/software-development/computer-science/threads/324685
O(2^n) – exponential time, may God have mercy on our souls, because this thing is fast growing. The algorithm growth will double for each new element in the data input! For n=1 we will have 2 operations, for n=2 4 operations, for n=3 we have jumped to 8 operations, and n=10 already 1024 operations. 99% of the times, show your boss an exponential algorithm and you'll have to clear your desk
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.