Suppose We Maintain an Array a of N Int Values

question 14

Multiple Choice

Suppose we maintain an array A of n int values as follows: A[0] < A[1] < . . . < A[i] > A[i + 1] > A[i + 2] > . . . > A[n - 1]
The ith element is the maximum in the array. What would be the lowest big-Oh notation for finding that element? Consider a variation of the binary search.

• A) O(1)
• B) O(log₂ n)
• C) O(n)
• D) O(n²)

---

Definitions:

Psychological Dependence

A form of dependence characterized by a perceived need for a substance or behavior to achieve a sense of well-being or to avoid discomfort.

Physiological Dependence

A state in which the body has adapted to the presence of a drug or substance, leading to withdrawal symptoms when the substance is reduced or discontinued.

Cardiac Problems

Health issues related to the heart, including conditions such as coronary artery disease, heart attacks, arrhythmias, and heart failure.

Paranoia

A mental condition characterized by delusions of persecution, unwarranted jealousy, or exaggerated self-importance, often without basis in reality.