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 vote175 views2 answers
What is fourier transform in python
Python
1 vote179 views1 answer
How to check if its later than python
Python
18 votes188 views5 answers
Continue statement in python
Python
5 votes183 views1 answer
Python check if class has function
Python
1 vote202 views1 answer
Keras import optimizer adam
Python
4 votes189 views2 answers
Compare two dictionaries in python
Python
0 vote176 views1 answer
<b> bold tag in python
Python
1 vote212 views1 answer
Sum values in django models
Python Django
3 votes169 views3 answers
NameError: name ‘pd’ is not defined
Python
0 vote242 views1 answer
How do i re-restablish the third reich
Python