Understanding the set() function

by

Sets are unordered, as you say. Even though one way to implement sets is using a tree, they can also be implemented using a hash table (meaning getting the keys in sorted order may not be that trivial).

If you’d like to sort them, you can simply perform:

sorted(set(y))

which will produce a sorted list containing the set’s elements. (Not a set. Again, sets are unordered.)

Otherwise, the only thing guaranteed by set is that it makes the elements unique (nothing will be there more than once).

Hope this helps!

More Related Contents:

  1. Why is the order in dictionaries and sets arbitrary?
  2. Get difference between two lists
  3. Does Python have an ordered set?
  4. How to “perfectly” override a dict?
  5. How to JSON serialize sets?
  6. How can I create a Set of Sets in Python?
  7. Time complexity of python set operations?
  8. Empty set literal?
  9. How to compare a list of lists/sets in python?
  10. How to make a set of lists
  11. Is python’s “set” stable?
  12. Why don’t Python sets preserve insertion order?
  13. Get unique values in List of Lists
  14. Which is faster and why? Set or List?
  15. What’s the algorithm of ‘set.intersection()’ in python?
  16. What is time complexity of a list to set conversion?
  17. python order of elements in set
  18. Is set.pop() deterministic?
  19. set of list of lists in python
  20. How to convert a set to a list in python?
  21. Access the sole element of a set [duplicate]
  22. How to create the union of many sets using a generator expression?
  23. A set union find algorithm
  24. Python, subclassing immutable types
  25. Python’s and Numpy’s nan and set
  26. Python: powerset of a given set with generators [duplicate]
  27. How to retrieve an element from a set without removing it?
  28. performing set operations on custom classes in python
  29. Python frozenset hashing algorithm / implementation
  30. Generate all subsets of size k (containing k elements) in Python

Leave a Comment