Set time complexity python

# empty set, avoid using {} in creating set or dictionary is created
x = set() 

# set {'e', 'h', 'l', 'o'} is created in unordered way
B = set('hello') 

# set{'a', 'c', 'd', 'b', 'e', 'f', 'g'} is created
A = set('abcdefg') 

# set{'a', 'b', 'h', 'c', 'd', 'e', 'f', 'g'} 
A.add('h')    

fruit ={'orange', 'banana', 'pear', 'apple'}

# True  fast membership testing in sets
'pear' in fruit      

'mango' in fruit     # False

A == B       # A is equivalent to B

A != B       # A is not equivalent to B

A <= B    # A is subset of B A <B>= B    

A > B     # A is proper superset of B

A | B        # the union of A and B

A & B     # the intersection of A and B

A - B        # the set of elements in A but not B

A ˆ B        # the symmetric difference

a = {x for x in A if x not in 'abc'}   # Set Comprehension

Similar codes

1 vote96 views3 answers
Py random list integers
Python
2 votes108 views1 answer
Predicate
Python
-1 vote103 views1 answer
Python encoding declaration
Python
1 vote119 views1 answer
Special characters list in python
Python
242 votes303 views6 answers
Python read text file
Python
15 votes111 views3 answers
Python get input from console
Python
1 vote99 views1 answer
How to download a file in python using idm
Python
1 vote111 views1 answer
Python select random subset from numpy array
Python
148 votes207 views10 answers
Grepper
Python
12 votes63 views1 answer
Convert integer column to string in pandas
Python