- Suppose we want to find the largest entry in an unsorted array of n entries. Algorithm A searches the entire array sequentially and records the largest entry seen so far. Algorithm B sorts the array into descending order and then reports the first entry as the largest. Compare the time efficiency of the two approaches. Coding is not required but highly recommended.

Coding is required in other to compare the time efficiency between two different search approaches.

Explanation

Assuming a linear search approach is to be conducted to find the highest entry in a sequential or descending order, there is need to write a programing code for the two approaches, then compare the time taken for each task to be completed . After, one can now tell the approach that is most time efficient.

answer:

fvbyunjk

explanation: