Tuple vs list comparison in Python - Performance Comparison
Start learning this pattern below
Jump into concepts and practice - no test required
When we compare two collections like tuples and lists, it is important to understand how long the comparison takes as the size grows.
We want to know how the time to compare changes when the collections get bigger.
Analyze the time complexity of the following code snippet.
list1 = [1, 2, 3, 4, 5]
tuple1 = (1, 2, 3, 4, 5)
if list1 == tuple1:
print("Equal")
else:
print("Not equal")
This code compares a list and a tuple element by element to check if they are equal.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Element-by-element comparison of the two sequences.
- How many times: Up to the length of the shorter sequence, comparing each pair once.
As the size of the list and tuple grows, the number of comparisons grows roughly the same.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 comparisons |
| 100 | 100 comparisons |
| 1000 | 1000 comparisons |
Pattern observation: The number of operations grows directly with the size of the sequences.
Time Complexity: O(n)
This means the time to compare grows linearly with the number of elements.
[X] Wrong: "Comparing a tuple is always faster than a list because tuples are immutable."
[OK] Correct: The comparison checks each element regardless of type; immutability does not speed up element-wise comparison.
Understanding how comparisons scale helps you write efficient code and explain your reasoning clearly during interviews.
"What if we compare two lists where one is a prefix of the other? How would the time complexity change?"
Practice
Solution
Step 1: Identify tuple and list syntax
Tuples are created with parentheses (), and lists with square brackets [].Step 2: Understand mutability
Tuples cannot be changed after creation (immutable), lists can be changed (mutable).Final Answer:
Tuples use parentheses and are immutable; lists use square brackets and are mutable. -> Option CQuick Check:
Tuple = immutable, parentheses; List = mutable, brackets [OK]
- Confusing brackets and parentheses
- Thinking tuples are mutable
- Assuming lists use parentheses
(1, 2, 3) with a list [1, 2, 3] for equality in Python?Solution
Step 1: Understand direct comparison
Comparing a tuple and list directly returns False because they are different types.Step 2: Convert list to tuple for comparison
Converting the list to a tuple makes the types match, so equality checks content and order.Final Answer:
tuple([1, 2, 3]) == (1, 2, 3) -> Option DQuick Check:
Convert list to tuple before comparing [OK]
- Comparing tuple and list directly
- Using 'is' instead of '=='
- Converting tuple to list instead of list to tuple
t = (4, 5, 6) l = [4, 5, 6] print(t == tuple(l))
Solution
Step 1: Convert list to tuple
tuple(l) converts list [4, 5, 6] to tuple (4, 5, 6).Step 2: Compare tuples
t == tuple(l) compares (4, 5, 6) == (4, 5, 6), which is True.Final Answer:
True -> Option AQuick Check:
Same content and type means equality True [OK]
- Expecting False because types differ
- Confusing '==' with 'is'
- Forgetting to convert list before comparing
t = (7, 8, 9)
l = [7, 8, 9]
if t == l:
print("Equal")
else:
print("Not equal")What is the problem and how to fix it?
Solution
Step 1: Understand type difference in comparison
Comparing tuple and list directly returns False even if elements match.Step 2: Fix by converting list to tuple
Convert list to tuple before comparing to match types and check content equality.Final Answer:
It prints "Not equal" because tuple and list types differ; fix by converting list to tuple. -> Option BQuick Check:
Convert list to tuple for correct equality check [OK]
- Assuming direct comparison works
- Trying to convert tuple to list instead
- Ignoring type difference in equality
data = [(1, 2), [1, 2], (3, 4), [3, 4]]
You want to count how many unique pairs are present, considering tuples and lists with the same elements as equal. Which code correctly counts unique pairs?
Solution
Step 1: Understand the problem
Tuples and lists with same elements should be treated as equal pairs.Step 2: Convert all elements to tuples
Convert each item to tuple so all pairs have the same type for comparison and hashing in set.Step 3: Use set to find unique pairs
Set removes duplicates, so length of set is count of unique pairs.Final Answer:
unique = set(tuple(x) for x in data) print(len(unique)) -> Option AQuick Check:
Convert all to tuple before set to count unique pairs [OK]
- Using set directly on mixed types
- Converting to list inside set (unhashable error)
- Ignoring type difference in uniqueness
