⚖️ Performance Considerations — Choosing the Right Tool

Different data structures have different speeds and memory usage. Choosing wisely matters!

🎯 Speed Comparison: Lookup Time

Looking up a value is fastest with dictionaries and sets, slower with lists.

# Creating data structures
numbers_list = [1, 2, 3, 4, 5]  # Takes O(n) to find an item
number_dict = {1: 'one', 2: 'two', 3: 'three'}  # O(1) to find
number_set = {1, 2, 3, 4, 5}  # O(1) to check membership

# Finding "3" in list requires checking each item
if 3 in numbers_list:  # Slow for large lists
    print("Found")

# Finding in dict/set is instant
if 3 in number_dict:  # Fast, even for huge collections
    print("Found")

💡 When to Use Each Structure

Use Lists for:

• Ordered items you access by position

• Data you need to modify frequently

• Small collections (100s of items)

Use Dictionaries for:

• Looking up values by meaningful keys

• Storing structured data (like people's attributes)

• Any time you'd repeat information

Use Sets for:

• Checking membership (is X in this collection?)

• Removing duplicates automatically

• Finding common items between collections

Use Tuples for:

• Fixed data that shouldn't change

• Dictionary keys

• Returning multiple values from functions

🎨 Real-World Example: Choosing Structure

# Problem: Track which emails are registered
emails_list = ["alice@example.com", "bob@example.com"]
# ❌ Slow: "bob@example.com" in emails_list  # Has to check every item

emails_set = {"alice@example.com", "bob@example.com"}
# ✅ Fast: "bob@example.com" in emails_set  # Instant!

# Problem: Store book information by ISBN
books_list = [
    {"isbn": "123", "title": "Python Basics"},
    {"isbn": "456", "title": "Web Dev"}
]
# ❌ Slow: Need to loop to find by ISBN

books_dict = {
    "123": {"title": "Python Basics", "author": "John"},
    "456": {"title": "Web Dev", "author": "Jane"}
}
# ✅ Fast: books_dict["123"] gives instant access

📊 Performance Quick Reference

🔑 Key Takeaways

• ✅ Dictionaries and sets are fastest for lookups

• ✅ Lists are fastest for ordered access by position

• ✅ Choose based on how you'll use the data

• ✅ For membership checks with large data, use sets

• ✅ Tuples use least memory

Ready to practice? Challenges | Quiz