As can be seen, this is going to run in O((n-1)!)
I think that's actually O(N^2) which, although not blazingly fast, is much, much faster than O(N!).
-sauoq "My two cents aren't worth a dime.";
In reply to Re: Quicker Array Searching
by sauoq
in thread Quicker Array Searching
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |