True of False: You can find the lower bound --> log(n) largest element in an unsorted array in O(n) time?

Question

If the array is unsorted wouldn't that force you to to search every element in the array. Thus makeing this true because searching every element in an array is done in O(n) time, correct?

Answer 1

true

Answer 2

You would not have to search the entire array (possibly), because once you find the value that you are searching for (the best case) you would end the search, otherwise I would have to say true, because I do not know of a algorithm that will search a Unsorted array not going sequentially.

Good luck in your data structures and algorithm design class?

Answer 3

you may opt for to rephrase your question in case you want a large number of solutions. in spite of the undeniable fact that the time period Bi skill you swing both ideas to men and females so for lack of a more beneficial precise description the answer may be that she is a toy. I doubt very a lot that she is a toy in spite of the undeniable fact that, it truly is more beneficial then in all likelihood she is merely exploring her sexuality and is uncertain of what she prefers so she is experimenting and is uncomfortable with the lesbian relationship otherwise she may be reciprocating.