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

146 votes131 views6 answers
Os file exists
Python
10 votes126 views3 answers
Matplotlib axis labels
Python
0 vote122 views1 answer
Python get pc runtime
Python
0 vote121 views1 answer
How to check if a list raises IndexError but wihing a if statement python
Python
12 votes118 views6 answers
Python hello world program
Python
0 vote115 views1 answer
How to leave a function python
Python
0 vote124 views1 answer
Powershell open file with default program
Python
2 votes115 views1 answer
Python USD to Euro Converter
Python
1 vote85 views4 answers
Create static library
Python
0 vote130 views1 answer
Dalsports
Python