Okay... If you don't have it in a DB, store the dates ordered in an array and make a binary search for the correct date. That way you don't have O(n) but just O(log2(n))
Use the date as a hash key for finding the other data.
In reply to Re: Date Ranges Question
by Skeeve
in thread Date Ranges Question
by lamberms
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |