Probabilistic search - psearch.tar.gz

[Wang Zhen]

sundaresh wrote:
> This (attached) search function of an unordered array of elements appears
> to have a logarithmic search time, like binary search of an ordered array.
> 
> 

I believe the time complexity of this algorithm is no better than a 
simple linear search. Would you care to prove your claim on the O(log n) 
complexity?

BTW, this newsgroup is for the D programming language.