The recurrence relation is similar to sequential search algoithm
So T(n) can be written as O(n)
=> T(n)=C*n(C is constant here)
T(1)=4 that means C=4
T(1000) would be 4*1000=4000
So Answer is 4000
64.3k questions
77.9k answers
244k comments
80.0k users