Just heard some bullshit that is bugging me... perhaps someone will know what I am talking about. Computer science grad student claimed that the most efficient way of searching a significantly large unordered set is by randomly picking an element and discarding ones that don't match. Apparently, this works in O(log(n)). ??? I said of course not, but he claims it is used for searching and sorting in computer vision, and then a PhD student even agreed with him, but they never got to explain. Were they trolling, because they seemed serious. This is some real gaslighting they are doing to me, please help