Question: Consider the following recursive algorithm: A: array of integer numbers L: left index of array A R: right index of array A function F3(A,L,R) :

Consider the following recursive algorithm: A: array of integer numbers L: left index of array A R: right index of array A function F3(A,L,R) : if(L>=R):returnAm=A[L]A[L]=A[R]A[R]=mreturnF3(A,L+1,R1) end function What is the recurrence equation describing the worst-case time complexity of the function call F3(A,0,N1) where N is the length of A ? Choose ONE option: a. T(N)=T(N/2)+N b. T(N)=C (C is a constant) c. T(N)=T(N)+C (C is a constant) d. T(N)=T(N/2)+N e. T(N)=T(N1)+C (C is a constant )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
