C++Guns – RoboBlog

22.10.2013

#Bits für Integer Zahlen

Filed under: Allgemein — Thomas @ 10:10

Wieviel Bits braucht man zum speichern einer Integerzahl?

floor( log2( abs(x) ) + 1) +1

Die +1 damit man auch negativen Zahlen abdecken kann.

No Comments

No comments yet.

RSS feed for comments on this post.

Sorry, the comment form is closed at this time.

Powered by WordPress