ANS: C1 = (n-1) C2 = (n-1)+(n-2)+…+1 = C3 = (n-1) T(n) = (n-1) . C1 + . C2 + (n-1)C3 T(n) = an2 + bn + c Here a,b and c are constants in term of C1, C2 and C3 T(n) = O(n2)
You are required to calculate (Step by Step) the worst case time complexity T(n) of the algorithm designed in Question No. 02.