You could probably replace the loops with some sort of recursion to give this an O(log(n)) running time by doing binary search. - Slime [ http://www.slimeland.com/ ]
Post a reply to this message