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

0 vote224 views1 answer
Python open multiple .py windows
Python
0 vote221 views1 answer
Df.rename(index=str, columns={"A": "a", "C": "c"}) what does index=str means
Python
3 votes192 views1 answer
Endswith python
Python
0 vote263 views1 answer
Plt change legend coordinates
Python
-1 vote255 views1 answer
Get git sha
Python
6 votes219 views3 answers
Python get dictionary keys
Python
0 vote257 views2 answers
Python7.blogspot.com=?m
Python
3 votes211 views1 answer
How to change python version on linux
Python
0 vote225 views1 answer
Remove words from set if in list python site:stackoverflow.com
Python
0 vote213 views1 answer
Merge two query sets django
Python