Set, a term in mathematics for a sequence consisting of distinct language is also extended in its language by Python and can easily be made using set().
set() method is used to convert any of the iterable to sequence of iterable elements with distinct elements, commonly called Set.
Syntax : set(iterable)
Parameters : Any iterable sequence like list, tuple or dictionary.
Returns : An empty set if no element is passed. Non-repeating element iterable modified as passed as argument.
Don’t worry if you get an unordered list from the set. Sets are unordered. Use sorted(set(sampleList)) to get it sorted
Code #1 : Demonstrating set() with list and tuple
Python3
# Python3 code to demonstrate the# working of set() on list and tuple# initializing listlis1 = [ 3, 4, 1, 4, 5 ]# initializing tupletup1 = (3, 4, 1, 4, 5)# Printing iterables before conversionprint("The list before conversion is : " + str(lis1))print("The tuple before conversion is : " + str(tup1))# Iterables after conversion are# notice distinct and elementsprint("The list after conversion is : " + str(set(lis1)))print("The tuple after conversion is : " + str(set(tup1))) |
Output:
The list before conversion is : [3, 4, 1, 4, 5]
The tuple before conversion is : (3, 4, 1, 4, 5)
The list after conversion is : {1, 3, 4, 5}
The tuple after conversion is : {1, 3, 4, 5}
- No parameters are passed to create the empty set
- Dictionary can also be created using set, but only keys remain after conversion, values are lost.
Code #2: Demonstration of working of set on dictionary
Python3
# Python3 code to demonstrate the# working of set() on dictionary# initializing listdic1 = { 4 : 'Lazyroar', 1 : 'for', 3 : 'Lazyroar' }# Printing dictionary before conversion# internally sortedprint("Dictionary before conversion is : " + str(dic1))# Dictionary after conversion are# notice lost keysprint("Dictionary after conversion is : " + str(set(dic1))) |
Dictionary before conversion is : {4: 'Lazyroar', 1: 'for', 3: 'Lazyroar'}
Dictionary after conversion is : {1, 3, 4}
Time Complexity: Set method is implemented as a hash table, so the time complexity is O(1).
