Largest/Smallest Int, Short, Long using pow?
I'm trying to figure out how to compute the largest and smallest int, short, and long, both signed and unsigned, using pow(). (Obviously not computing min unsigned number since that's zero). (And I'm using cmath library). What would this look like syntax wise?
Assuming 2's compliment and 8 bit chars, which most modern systems use:
max = pow(2,size_of(int)*8-1)-1
You can read up on two's compliment numbers for the other values. But there are macros and templates that will give you the correct constants without using pow.
Last edited by King Mir; 01-20-2013 at 10:00 PM.
It is too clear and so it is hard to see.
A dunce once searched for fire with a lighted lantern.
Had he known what fire was,
He could have cooked his rice much sooner.
Don't use pow for this, it would be like going around the block just to get next foor. Just use a bitshift.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
For future reference, cross-posting (i.e. here and here) is generally considered bad etiquette.
To understand why, I'd recommend reading this through: How To Ask Questions The Smart Way
Some compilers can do that as an optimization anyway. So it's not a big loss.Originally Posted by iMalc
It is too clear and so it is hard to see.
A dunce once searched for fire with a lighted lantern.
Had he known what fire was,
He could have cooked his rice much sooner.
Only if they know what pow actually does, which is not guaranteed.
