One often missed point in these analyses is that Big-O is based on input SIZE.. so if your algorithm is numeric the SIZE is the number of bits, not the number itself.
Hence, even "linear" versions of the fibonacci algorithm are called "pseudo-polynomial" because in reality their solutions are exponential with respect to the number of bits used.
I am a software Developer, experienced in both front and back-end development, proficient in HTML5, CSS3, SASS, JavaScript, Reactjs, Nodejs, Expressjs and Mongodb etc.
Yes! This wasn't a missed point. The article is like an intro into BigO while taking away the low level complexities.
We all know that just a single article can't be enough to explain the complete concepts of BigO from top to bottom.
Anyways thanks for pointing that out.
I will be writing a more advanced article targeting more experienced folks like yourself.
I am a software Developer, experienced in both front and back-end development, proficient in HTML5, CSS3, SASS, JavaScript, Reactjs, Nodejs, Expressjs and Mongodb etc.
One often missed point in these analyses is that Big-O is based on input SIZE.. so if your algorithm is numeric the SIZE is the number of bits, not the number itself.
Hence, even "linear" versions of the fibonacci algorithm are called "pseudo-polynomial" because in reality their solutions are exponential with respect to the number of bits used.
Yes! This wasn't a missed point. The article is like an intro into BigO while taking away the low level complexities.
We all know that just a single article can't be enough to explain the complete concepts of BigO from top to bottom.
Anyways thanks for pointing that out.
I will be writing a more advanced article targeting more experienced folks like yourself.
Cheers😃
And once again thank you for pointing this out. Shows you actually read the article!
Thanks alot.❤️