Why not a different algorithm, based on the number of possible alternatives? For instance, if only 2 or 3, then a cascading IF/THEN/ELSE. If over a thousand, maybe a hash table. Just a thought, I'm sure there are many possibilities.
On Thu, Jul 18, 2013 at 3:02 PM, Mike Schwab <[email protected]>wrote: > Alphabetic would almost certainly be very inefficient. A minimal > optimization would be a binary search of a table or states, or order > the states in most to least order for the (1. number of transactions, > 2. number of policies, 3. number of agents, 4, population).Setting a > subscript once and grabbing the values of the table would be great. > > And the more values you have the better the binary search becomes. > > -- This is a test of the Emergency Broadcast System. If this had been an actual emergency, do you really think we'd stick around to tell you? Maranatha! <>< John McKown ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
