To return the smallest element in array, every element in the array needs to be traversed atleast once.
In any sorting technique, at least one pass is required to scan all the elements which would take Ω(n) time at minimum. Any algorithm trying to read through all elements would take either n or greater than n time. Any