What makes sets faster than lists?

by

list: Imagine you are looking for your socks in your closet, but you don’t know in which drawer your socks are, so you have to search drawer by drawer until you find them (or maybe you never do). That’s what we call O(n), because in the worst scenario, you will look in all your drawers (where n is the number of drawers).

set: Now, imagine you’re still looking for your socks in your closet, but now you know in which drawer your socks are, say in the 3rd drawer. So, you will just search in the 3rd drawer, instead of searching in all drawers. That’s what we call O(1), because in the worst scenario you will look in just one drawer.

More Related Contents:

  1. Get difference between two lists
  2. Python Sets vs Lists
  3. Python -Intersection of multiple lists?
  4. In Python, when to use a Dictionary, List or Set?
  5. Add list to set
  6. How to construct a set out of list items in python?
  7. How to compare a list of lists/sets in python?
  8. How to make a set of lists
  9. What is the difference between sets and lists in Python?
  10. Get unique values in List of Lists
  11. Which is faster and why? Set or List?
  12. What is time complexity of a list to set conversion?
  13. Fastest way to search a list in python
  14. Get difference between two lists with Unique Entries
  15. set of list of lists in python
  16. How to convert a set to a list in python?
  17. Find non-common elements in lists
  18. How can I return two values from a function in Python?
  19. Python pandas insert list into a cell
  20. Is there a short contains function for lists?
  21. Subtracting 2 lists in Python
  22. Looping over a list in Python [closed]
  23. Finding elements not in a list
  24. Removing Punctuation From Python List Items
  25. Using a dict to translate numbers to letters in python
  26. How can I make a dictionary (dict) from separate lists of keys and values?
  27. How do I get the number of elements in a list (length of a list) in Python?
  28. flatten list of list through list comprehension
  29. Counting depth or the deepest level a nested list goes to
  30. Which is the most efficient way to iterate through a list in python?

Leave a Comment