Question

given an example showing how redundant computation make an algorithm inefficient​

Answer 1

Explanation:

Counting the operations. One way to measure the efficiency of an algorithm is to count how many operations it needs in order to find the answer across different input sizes. Let's start by measuring the linear search algorithm, which finds a value in a list.

Answer 2

Explanation:

here is your answer.....

give me thanks.

please don't mark me brainlist