Time Complexity for Adding Element in Python Set vs List

Adding elements differs due to their distinct underlying structures and requirements for uniqueness or order. Let's explore and compare the time complexity by adding elements to lists and sets. In this article, we will explore the differences in time complexities between a Set and a List if we add an element to that.

Adding elements in Python Set

When we add an element in the set using add () method , Python computes its hash to check if it’s already in the set quickly. This allows sets to perform fast O(1) membership checks, avoiding the need for slower searches.

{1, 2, 3, 4}

Explanation :

• Initializes a set and adds the 4 to the set. Since sets do not allow duplicates, it will only add 4 if it's not already in the set.

Time complexity:

• O(1) for initializing a set is constant time and adding an elements.
• O(n) for printing the list, as it requires iterating through all elements.

Adding Elements in Python List

When we add an element to a list using the append() method, Python directly adds the element to the end. This operation has O(1) amortized time complexity, as no hashing or duplicate checks are needed.

[1, 2, 3, 4]

Explanation:

• Initializes a list and adds 4 to the list using the append() method. Lists allow duplicates, so 4 will be added even if it already exists in the list.

Time Complexity:

• O(1) for initialization and adding an element using append().
• O(n) for printing the list, as it requires iterating through all elements.

Compare Time Complexity for Adding Element in Python Set vs List