The fastest possible solution would be to utilize quantum mechanics, whereby all possible solutions would be computed in near instantaneous time and with all possible permutations. ;-) -marc On 9/6/03 22:47, "Mike Hord" wrote: > Right after finished my embedded systems class in college, a friend of mine > was taking it from a different prof. The professor gave them a challenge: > > In the shortest possible time, reverse the order of the bits in a random > data register. Assume this is the time critical element of the application, > and nothing about the application is as important as getting the order of > these bits reversed as quickly as possible. > > Assume the processor is a 16F876. > > My friend came up with the fastest possible means I've yet seen. What > say you all? > > Mike H. > > _________________________________________________________________ > Add photos to your e-mail with MSN 8. Get 2 months FREE*. > http://join.msn.com/?page=features/featuredemail > > -- > http://www.piclist.com#nomail Going offline? Don't AutoReply us! > email listserv@mitvma.mit.edu with SET PICList DIGEST in the body > -------------------------------------------------- Marc Nicholas Geekythings Inc. C/416.543.4896 UNIX, Database, Security and Networking Consulting -- http://www.piclist.com hint: To leave the PICList mailto:piclist-unsubscribe-request@mitvma.mit.edu