Probabilistic search - psearch.tar.gz

[Sean Kelly]

Oskar Linde wrote:
> 
> I'm not sure if this is intended as a joke or not, but I am sorry to 
> tell that your code is not logarithmic. It is easy to prove that there 
> are no better algorithm than O(n) for searching an unordered array on a 
> deterministic single thread.

Perhaps, but some algorithms have a better average case than others 
assuming certain (typical) conditions.  If there were simply no point, 
why all the bother back in the 60s?

By the way, as I just woke up, I haven't had a chance to look at the 
algorithm yet.


Sean