??? 01/06/06 06:53 Modified: 01/06/06 07:04 Read: times |
#106675 - timing Responding to: ???'s previous message |
Your code is very smart, I can see how you minimized the time of conversion.
I ran both versions of BinToBcd on the simulator and it showed: at var = 0xffff my version took 326 mseconds to complete while yours took 150 useconds to complete (quite impressive) with no code optimization switched on. With code optimization turned on, yours took 123.8 usec to complete while my version took 273.8 mseconds to complete. Although 326 msec is ok for my application since I only measure speed once every use (10 Seconds period min) I will switch to your version because I keep reusing my code and surely I might need faster algorithm in the future. Many thanx Dan. Mahmood |
Topic | Author | Date |
Weekend Puzle | 01/01/70 00:00 | |
symmetry | 01/01/70 00:00 | |
no printf | 01/01/70 00:00 | |
Dont' know but... | 01/01/70 00:00 | |
Don't be fast on the trigger please | 01/01/70 00:00 | |
Ah but.. | 01/01/70 00:00 | |
var | 01/01/70 00:00 | |
can't answer | 01/01/70 00:00 | |
oddometer | 01/01/70 00:00 | |
Well Done !! | 01/01/70 00:00 | |
simple but slow | 01/01/70 00:00 | |
Still simple, but faster | 01/01/70 00:00 | |
No fun at all. | 01/01/70 00:00 | |
32-bit / 10-digit conversion | 01/01/70 00:00 | |
timing | 01/01/70 00:00 | |
Big Display | 01/01/70 00:00 | |
if that is not good enough | 01/01/70 00:00 | |
Even my old eyes could see that! n/t | 01/01/70 00:00 | |
ideas![]() | 01/01/70 00:00 | |
Optimisation and comment | 01/01/70 00:00 | |
Re: comment | 01/01/70 00:00 | |
puzzle | 01/01/70 00:00 | |
Puzzle | 01/01/70 00:00 | |
ok ok | 01/01/70 00:00 | |
decimal unpacker | 01/01/70 00:00 | |
a quick look reveal that it seems to be | 01/01/70 00:00 |