My lecture states that search in a sorted array can be done in ω(n).
Why is that? I know it can be done with "normal" search in Θ(n) and with binary search in O(log(n)).
My guess would be, make the algorithm so bad that it is in
ω(n) but that's a kinda silly guess I think.
Thank you all in advance.