Can a randomized binary search have an O(1) complexity at least in practice?

The note suggests the possibility for a randomized binary search to have an O(1) complexity at least in practice provided only that the element being searched for is a random integer less than or equal to the array size and hence or otherwise when the probability of its presence in the array is a near unity.