If you're really that worried about the time complexity issue then it
all depends on what the actual code is and how often it will be
accessed. You need to look at something called time complexity within
Discrete Mathematics to find out exactly how fast each piece of code
will run. If you send me the code fragments (that is if you have both
of them) I could tell you which one ran faster. To understand it all
you really need to do some research on theta and alpha notation etc.
It's really not that complex, but its not something you'll grasp (well
most people don't anyway) right away.
+------------------------------------------------------------+
| Ensure that you have read the CircleMUD Mailing List FAQ: |
| http://democracy.queensu.ca/~fletcher/Circle/list-faq.html |
+------------------------------------------------------------+
This archive was generated by hypermail 2b30 : 12/08/00 PST