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 vote142 views1 answer
Create New spreadsheet
Python
1 vote137 views3 answers
Uninstall python ubuntu 18.04
Python
0 vote135 views1 answer
Python write subprocess stdout stderr to file
Python
1 vote149 views1 answer
What do i do if my dog eats paper
Python
0 vote138 views2 answers
Python argsort
Python
0 vote140 views1 answer
Python list three from the back
Python
0 vote136 views1 answer
Differentate derivative differentation
Python
1 vote187 views1 answer
Django queryset multiple filters
Python Django
1 vote138 views1 answer
Plt.savefig without showing
Python
0 vote175 views1 answer
Discord python bot how to change someone's nickname
Python