Answer TRUE or FALSE.
No algorithm for searching in an unsorted
array can be worse than O(n) since any algorithm
must look at every value in the array in the worst case.
Do you think that sequential search is the only algorithm to search an unsorted array?
Can't someone write a worse algorithm, perhaps by adding unnecessary work?