18. Recurrence Relation to Runtime Given an algorithm with the recurrence relation of T(n)= T(n-1) +n, what is the Big O runtime? This equation means that there is a function that when called with...

18

Extracted text: 18. Recurrence Relation to Runtime Given an algorithm with the recurrence relation of T(n)= T(n-1) +n, what is the Big O runtime? This equation means that there is a function that when called with input size n, it performs n work and then recursively calls the function for the n-1 case. Assume T(0) -1. Pick ONE option O(nlogin)) O(n*(log(n)) Oflogin) (n^2) Clear Selection 19. Binary Search Implementation Below is an implementation of binary search, but the implementation contains an error. What is the error? binary search(array, target): left.right e,len(array)-1 while left ce right: R1d - left - ((right- left) // 2) A arnat H SPFAulnial 253 254 PE84