algorithm - What is the most efficient way to find elements in an unsorted list? -

given unsorted list in array, take @ least linear time find number of elements smaller x? if so, why?

yes, need examine every number @ least once know if less specified threshold. if numbers not sorted there nothing can infer them.