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

2 votes345 views1 answer
Generate a list of random non repeated numbers python
Python
0 vote353 views1 answer
Declaring a 5x5 matrix python\
Python
60 votes346 views6 answers
Python remove duplicates from list
Python
0 vote335 views1 answer
Add authorization header in python requests
Python
1 vote353 views1 answer
Pandas iterate over a series
Python
2 votes362 views1 answer
Absolute value columns pandas
Python
0 vote375 views1 answer
Stackoverflow: install old version of networkx
Python
-2 votes340 views1 answer
Images download
Python
12 votes349 views5 answers
Conda python update
Python
0 vote385 views1 answer
Find max, min character
Python