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:

Genetic Screening

A medical process that involves testing DNA to identify changes or mutations that may lead to disease or illness.

Work Pacing

Involves the rate at which tasks are expected to be completed in the work environment, often set by employer expectations or the demands of the job itself.

Organizational Stress

The stress experienced by employees due to factors related to their working environment, job roles, and organizational pressures.

Quality of Working Life

The degree of satisfaction employees feel about their job roles, considering factors like work environment, job security, compensation, and work-life balance.