introduction to algorithms:problem 4-2

assume that it's 32 bits per integer;
we can compute an integer's value in O(32) time converting from binary to decimal;
so,including this added step,the total time we spend must be O(32n);
of course,the coefficient can be omitted;
consequently,we trivially get the result O(n);
that is all;