Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

What is the time complexity of the following code: function T(int n) { int n1 = T(n/2) int n2 = n1 n1 + n1 int

What is the time complexity of the following code:

function T(int n)

{ int n1 = T(n/2)

int n2 = n1 n1 + n1

int sum = 0

for i = 1 to n

for j = 1 to n

sum+=n1 i + n2*j return sum }

// Assume T(1) = 1

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Introduction To Data Mining

Authors: Pang Ning Tan, Michael Steinbach, Vipin Kumar

1st Edition

321321367, 978-0321321367

Students also viewed these Databases questions