Calculating the time complexity of algorithm

Question

I'm new to calculating time complexity. I've searched around and I understand the very basics of it. I have the following algorithm, I'm trying to calculate the complexity of for practice. Am I correct it would be O(n)?

Also, are there any recommendations on places to practice this concept?

class Solution:
    def twoSum(self, nums, target):
        h = {} 
        for i, num in enumerate(nums): 
            n = target - num
            if n not in h:
                h[num] = i
            else:
                return [h[n],i]

Answer = Solution()
print (Answer.twoSum([2,3,4], 7))

Sadman Sakib · Accepted Answer · 2020-06-25 07:37:32Z

1

Yes, you are right, this algo's complexity would be Linear (O(n)). Considering there are n numbers and the loop in the function runs for n times.

answered Jun 25, 2020 at 7:37

Sadman Sakib

6154 silver badges10 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Calculating the time complexity of algorithm

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related