Find the Time Complexity

Find out the time complexity for the below algorithm

test = 0
for i in range(n):
test = test + 1

for j in range(n):
test = test – 1

Analysis:

test = 0      ==> 1
for i in range(n): ==> n
test = test + 1       ===> n

for j in range(n):  ==> n
test = test – 1  ==> n

4n+1 ==> ignore constant = > O(n)

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s