Sorry to disturb you again. But i tested my code against Akinobu's one
and the test result shows my code takes less cpu time than that of
Akinobu's.
Here is the code i used to determine performance
--
#include<stdio.h>
#include<time.h>
int main()
{
int i = 100000000;
printf("%ld\n", (long)clock());
for(; i>0; i--) {
bitrev32(0x00face32);
}
printf("%ld", (long)clock());
}
--
OUTPUT:
[using Akinobu's bitrev32()]
0
6010000
[using my bitrev32()]
0
3990000
And using bitrev8() instead of bitrev32() the result gives the output
like this:
[using Akinobu's bitrev8()]
0
770000
[using my bitrev8()]
0
2360000
My processor is 1.4 GHz one.
I am not forcing you to review my code( or i've no expectation of
inclusion of it ) but its just a curiousity: what is truth behind
the output.
Regards,
Soumya
--
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.
--
